M. Aadi and A. D. Gordon, A calculus for cryptographic protocols: The spi calculus. Information and Computation, pp.1481-70, 1999.

M. Aadi and P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), Proc. 1st IFIP International conference on Theorectical Computer Science (IFIP-TCS), pp.3-22, 2000.

M. Abadi and V. Cortier, Deciding Knowledge in Security Protocols under (Many More) Equational Theories, 18th IEEE Computer Security Foundations Workshop (CSFW'05), pp.62-76, 2005.
DOI : 10.1109/CSFW.2005.14
URL : https://hal.archives-ouvertes.fr/inria-00000554

M. Abadi and V. Cortier, 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

M. Roberto, D. Amadio, and . Lugiez, On the reachability problem in cryptographic protocols, Lecture Notes in Computer Science, vol.1877, pp.380-394, 2000.

R. M. Amadio, D. Lugiez, and V. Vanackère, 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

M. Baudet, Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.16-25, 2005.
DOI : 10.1145/1102120.1102125

V. Bernat and H. Comon-lundh, Normal Proofs in Intruder Theories, Lecture Notes in Computer Science, vol.40, issue.2, pp.151-166, 2006.
DOI : 10.1007/978-3-540-24725-8_25

M. Burrows, M. Abadi, and R. M. Needham, A logic of authentication, ACM Transactions on Computer Systems, vol.8, issue.1, pp.18-36, 1990.
DOI : 10.1145/77648.77649

Y. Chevalier and M. Kourjieh, Key Substitution in the Symbolic Analysis of Cryptographic Protocols, Lecture Notes in Computer Science, vol.4855, pp.121-132, 2007.
DOI : 10.1007/978-3-540-77050-3_10
URL : https://hal.archives-ouvertes.fr/hal-00183337

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents, FSTTCS, pp.124-135, 2003.
DOI : 10.1007/978-3-540-24597-1_11
URL : https://hal.archives-ouvertes.fr/inria-00103935

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.247-274, 2005.
DOI : 10.1109/LICS.2003.1210066
URL : https://hal.archives-ouvertes.fr/inria-00103954

Y. Chevalier, D. Lugiez, and M. Rusinowitch, Towards an Automatic Analysis of Web Service Security, Lecture Notes in Computer Science, vol.4720, pp.133-147, 2007.
DOI : 10.1007/978-3-540-74621-8_9
URL : https://hal.archives-ouvertes.fr/inria-00557707

Y. Chevalier and M. Rusinowitch, Combining Intruder Theories, Lecture Notes in Computer Science, vol.3580, pp.639-651, 2005.
DOI : 10.1007/11523468_52
URL : https://hal.archives-ouvertes.fr/inria-00070512

J. Clark and J. Jacob, A survey of authentication protocol literature

H. Comon-lundh, Intruder Theories (Ongoing Work), Lecture Notes in Computer Science, vol.2987, pp.1-4, 2004.
DOI : 10.1007/978-3-540-24727-2_1

H. Comon-lundh and S. Delaune, The Finite Variant Property: How to Get Rid of Some Algebraic Properties, Lecture Notes in Computer Science, vol.3467, pp.294-307, 2005.
DOI : 10.1007/978-3-540-32033-3_22

V. Cortier, S. Delaune, and P. Lafourcade, A survey of algebraic properties used in cryptographic protocols, Journal of Computer Security, vol.14, issue.1, 2004.
DOI : 10.3233/JCS-2006-14101
URL : https://hal.archives-ouvertes.fr/inria-00000552

N. Dershowitz and J. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp.243-320, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.2, pp.198-207, 1983.
DOI : 10.1109/TIT.1983.1056650

J. Hullot, Canonical forms and unification, Lecture Notes in Computer Science, vol.87, pp.318-334, 1980.
DOI : 10.1007/3-540-10009-1_25

S. Kremer and M. Ryan, Analysis of an Electronic Voting Protocol in the Applied Pi Calculus, LNCS, vol.3444, pp.186-200, 2005.
DOI : 10.1007/978-3-540-31987-0_14

G. Lowe, An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters, vol.56, issue.3, 1995.
DOI : 10.1016/0020-0190(95)00144-2

G. Lowe and . Casper, A compiler for the analysis of security protocols, CSFW, pp.18-30, 1997.

G. Lowe, Towards a completeness result for model checking of security protocols, Journal of Computer Security, vol.7, issue.1, 1999.

A. Martelli and U. Montanari, An Efficient Unification Algorithm, ACM Transactions on Programming Languages and Systems, vol.4, issue.2, pp.258-282, 1982.
DOI : 10.1145/357162.357169

C. Meadows, 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

J. K. Millen and V. Shmatikov, 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

J. C. Mitchell, M. Mitchell, and U. Stern, Automated analysis of cryptographic protocols using Mur??, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.141-153, 1997.
DOI : 10.1109/SECPRI.1997.601329

P. Narendran, F. Pfenning, and R. Statman, Abstract, The Journal of Symbolic Logic, vol.32, issue.02, pp.636-647, 1997.
DOI : 10.1007/BF01084396

M. Rusinowitch and M. Turuani, Protocol insecurity with a finite number of sessions and composed keys is NP-complete, Theoretical Computer Science, vol.299, issue.1-3, pp.1-3451, 2003.
DOI : 10.1016/S0304-3975(02)00490-5