Hubert Comon-Lundh

Publication Activity (10 Years)

Years Active: 2003-2017
Publications (10 Years): 1

Top Topics

Symbolic Representation

Desirable Properties

Computer Security

Connectionist Systems

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune
A procedure for deciding symbolic equivalence between sets of constraint systems. Inf. Comput. 255 (2017)
Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
Deducibility constraints and blind signatures. Inf. Comput. 238 (2014)
Gergei Bana, Hubert Comon-Lundh
A Computationally Complete Symbolic Attacker for Equivalence Properties. CCS (2014)
Hubert Comon-Lundh
LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems. LICS (2013)
Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
Tractable Inference Systems: An Extension with a Deducibility Predicate. CADE (2013)
Gergei Bana, Hubert Comon-Lundh
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. POST (2012)
Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
Security proof with dishonest keys. IACR Cryptol. ePrint Arch. 2012 (2012)
Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto, Hideki Sakurada
Computational Soundness of Indistinguishability Properties without Computable Parsing. ISPEC (2012)
Hubert Comon-Lundh, Catherine A. Meadows
Special Issue on Security and Rewriting Foreword. J. Autom. Reason. 48 (2) (2012)
Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri
Security Proof with Dishonest Keys. POST (2012)
Gergei Bana, Hubert Comon-Lundh
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. IACR Cryptol. ePrint Arch. 2012 (2012)
Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune
Trace equivalence decision: negative tests and non-determinism. CCS (2011)
Hubert Comon-Lundh, Véronique Cortier
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. STACS (2011)
Hubert Comon-Lundh, Ralf Küsters, Catherine A. Meadows
Security and Rewriting (Dagstuhl Seminar 11332). Dagstuhl Reports 1 (8) (2011)
Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune
Automating Security Analysis: Symbolic Equivalence of Constraint Systems. IJCAR (2010)
Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Log. 11 (2) (2010)
Reynald Affeldt, Hubert Comon-Lundh
Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables. Formal to Practical Security (2009)
Martín Abadi, Bruno Blanchet, Hubert Comon-Lundh
Models and Proofs of Protocol Security: A Progress Report. CAV (2009)
Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
Deducibility Constraints. ASIAN (2009)
Sergiu Bursuc, Hubert Comon-Lundh
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. RTA (2009)
Hubert Comon-Lundh, Yusuke Kawamoto, Hideki Sakurada
Computational and Symbolic Anonymity in an Unbounded Network. JSIAM Lett. 1 (2009)
Hubert Comon-Lundh, Véronique Cortier
Computational soundness of observational equivalence. CCS (2008)
Hubert Comon-Lundh
About models of security protocols. FSTTCS (2008)
Hubert Comon-Lundh
Challenges in the Automated Verification of Security Protocols. IJCAR (2008)
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
Visibly Tree Automata with Memory and Constraints. Log. Methods Comput. Sci. 4 (2) (2008)
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
Visibly Tree Automata with Memory and Constraints CoRR (2008)
Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
Associative-Commutative Deducibility Constraints. STACS (2007)
Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
Deciding security properties for cryptographic protocols. Application to key cycles CoRR (2007)
Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
Tree Automata with Memory, Visibility and Structural Constraints. FoSSaCS (2007)
Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
Deducibility Constraints, Equational Theory and Electronic Money. Rewriting, Computation and Proof (2007)
Vincent Bernat, Hubert Comon-Lundh
Normal Proofs in Intruder Theories. ASIAN (2006)
Hubert Comon-Lundh, Stéphanie Delaune
The Finite Variant Property: How to Get Rid of Some Algebraic Properties. RTA (2005)
Hubert Comon-Lundh
Normal Attacks on Security Protocols. Abstract State Machines (2005)
Hubert Comon-Lundh, Véronique Cortier
Security properties: two agents are sufficient. Sci. Comput. Program. 50 (1-3) (2004)
Hubert Comon-Lundh
Intruder Theories (Ongoing Work). FoSSaCS (2004)
Hubert Comon-Lundh, Véronique Cortier
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. RTA (2003)
Hubert Comon-Lundh, Vitaly Shmatikov
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. LICS (2003)
Hubert Comon-Lundh, Ralf Treinen
Easy Intruder Deductions. Verification: Theory and Practice (2003)
Hubert Comon-Lundh, Véronique Cortier
Security Properties: Two Agents Are Sufficient. ESOP (2003)