| 2014 | CCS | A Computationally Complete Symbolic Attacker for Equivalence Properties. | Gergei Bana, Hubert Comon-Lundh |
| 2013 | CADE | Tractable Inference Systems: An Extension with a Deducibility Predicate. | Hubert Comon-Lundh, Vronique Cortier, Guillaume Scerri |
| 2013 | LICS | LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems. | Hubert Comon-Lundh |
| 2012 | ISPEC | Computational Soundness of Indistinguishability Properties without Computable Parsing. | Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto, Hideki Sakurada |
| 2011 | CCS | Trace equivalence decision: negative tests and non-determinism. | Vincent Cheval, Hubert Comon-Lundh, Stphanie Delaune |
| 2011 | STACS | How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. | Hubert Comon-Lundh, Vronique Cortier |
| 2010 | CADE | Automating Security Analysis: Symbolic Equivalence of Constraint Systems. | Vincent Cheval, Hubert Comon-Lundh, Stphanie Delaune |
| 2009 | CAV | Models and Proofs of Protocol Security: A Progress Report. | Martn Abadi, Bruno Blanchet, Hubert Comon-Lundh |
| 2008 | CADE | Challenges in the Automated Verification of Security Protocols. | Hubert Comon-Lundh |
| 2008 | CCS | Computational soundness of observational equivalence. | Hubert Comon-Lundh, Vronique Cortier |
| 2007 | FOSSACS | Tree Automata with Memory, Visibility and Structural Constraints. | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin |
| 2007 | STACS | Associative-Commutative Deducibility Constraints. | Sergiu Bursuc, Hubert Comon-Lundh, Stphanie Delaune |
| 2004 | FOSSACS | Intruder Theories (Ongoing Work). | Hubert Comon-Lundh |
| 2003 | ESOP | Security Properties: Two Agents Are Sufficient. | Hubert Comon-Lundh, Vronique Cortier |
| 2003 | LICS | Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. | Hubert Comon-Lundh, Vitaly Shmatikov |