Hubert Comon-Lundh

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