Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.367, issue.1-2, pp.2-32, 2006. ,
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00000554
On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, vol.290, issue.1, pp.695-740, 2003. ,
DOI : 10.1016/S0304-3975(02)00090-7
URL : https://hal.archives-ouvertes.fr/inria-00072478
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, Journal of Symbolic Computation, vol.21, issue.2, pp.211-243, 1996. ,
DOI : 10.1006/jsco.1996.0009
An On-the-Fly Model-Checker for Security Protocol Analysis, Proceedings of ESORICS'03, pp.253-270, 2003. ,
DOI : 10.1007/978-3-540-39650-5_15
Symbolic Trace Analysis of Cryptographic Protocols, Proceedings of the 28th ICALP'01, pp.667-681, 2001. ,
DOI : 10.1007/3-540-48224-5_55
Intercepting mobile communications, Proceedings of the 7th annual international conference on Mobile computing and networking , MobiCom '01, pp.180-189, 2001. ,
DOI : 10.1145/381677.381695
A Symbolic Intruder Model for Hash-Collision Attacks, Proceedings of the 11th Annual Asian Computing Science Conference (ASIAN'06), 2006. ,
DOI : 10.1007/11535218_2
URL : https://hal.archives-ouvertes.fr/hal-00116845
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents, Proceedings of the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'03, pp.124-135, 2003. ,
DOI : 10.1007/978-3-540-24597-1_11
URL : https://hal.archives-ouvertes.fr/inria-00103935
Combining Intruder Theories, ICALP, pp.639-651, 2005. ,
DOI : 10.1007/11523468_52
URL : https://hal.archives-ouvertes.fr/inria-00070512
Combining intruder theories, Research report 5495, 2005. ,
A tool for lazy verification of security protocols, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001), pp.373-376, 2001. ,
DOI : 10.1109/ASE.2001.989832
URL : https://hal.archives-ouvertes.fr/inria-00107545
The Finite Variant Property: How to Get Rid of Some Algebraic Properties, Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), pp.294-307, 2005. ,
DOI : 10.1007/978-3-540-32033-3_22
Intruder Theories (Ongoing Work), 7th International Conference, pp.1-4, 2004. ,
DOI : 10.1007/978-3-540-24727-2_1
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.271-280, 2003. ,
DOI : 10.1109/LICS.2003.1210067
Easy Intruder Deductions, Theory and Practice Lecture Notes in Computer Science, vol.2772, pp.225-242, 2003. ,
DOI : 10.1007/978-3-540-39910-0_10
An Improved Constraint-Based System for the Verification of Security Protocols, pp.326-341, 2002. ,
DOI : 10.1007/3-540-45789-5_24
A decision procedure for the verification of security protocols with explicit destructors, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.278-287, 2004. ,
DOI : 10.1145/1030083.1030121
URL : https://hal.archives-ouvertes.fr/inria-00579012
Rewrite Systems, pp.243-320, 1990. ,
DOI : 10.1016/B978-0-444-88074-1.50011-1
On the Security of Public-Key Protocols, IEEE Transactions on Information Theory, vol.2, issue.29 ,
New results on local inference relations, pp.403-412, 1992. ,
On word problems in equational theories, LNCS, vol.267, pp.54-71, 1987. ,
DOI : 10.1007/3-540-18088-5_6
URL : https://hal.archives-ouvertes.fr/inria-00075875
Automata-Based Analysis of Recursive Cryptographic Protocols, 21st Symposium on Theoretical Aspects of Computer Science, pp.382-393, 2004. ,
DOI : 10.1007/978-3-540-24749-4_34
Intruder Deduction for AC-Like Equational Theories with Homomorphisms, Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), pp.308-322, 2005. ,
DOI : 10.1007/978-3-540-32033-3_23
Automatic recognition of tractability in inference relations, Journal of the ACM, vol.40, issue.2, pp.284-303, 1993. ,
DOI : 10.1145/151261.151265
Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.166-175, 2001. ,
DOI : 10.1145/501983.502007
Symbolic protocol analysis with an Abelian group operator or Diffie???Hellman exponentiation, Journal of Computer Security, vol.13, issue.3, pp.515-564, 2005. ,
DOI : 10.3233/JCS-2005-13306
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation, RTA, pp.165-179, 2003. ,
DOI : 10.1007/3-540-44881-0_13
The NRL Protocol Analyzer: An Overview, The Journal of Logic Programming, vol.26, issue.2, pp.113-131, 1996. ,
DOI : 10.1016/0743-1066(95)00095-X
A unification algorithm for the group Diffie-Hellman protocol, in: Workshop on Issues in the Theory of Security (in conjunction with POPL'02), 2002. ,
Handbook of applied cryptography, 2000. ,
DOI : 10.1201/9781439821916
Protocol insecurity with finite number of sessions is NP-complete, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.174-190, 2001. ,
DOI : 10.1109/CSFW.2001.930145
URL : https://hal.archives-ouvertes.fr/inria-00100411
Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation, Proceedings of ESOP'04, pp.355-369, 2004. ,
DOI : 10.1007/978-3-540-24725-8_25
Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation, vol.8, issue.1-2, pp.51-99, 1989. ,
DOI : 10.1016/S0747-7171(89)80022-7
The srp authentication and key exchange system, Tech. Rep. RFC 2945, IETF ? Network Working Group, 2000. ,