E. Or and .. , 17 Bull's Authentication Protocol, Wired Equivalent Privacy Protocol, vol.17

E. Curves and .. , 31 Elliptic Curve Digital Signature Algorithm (ECDSA), p.32

M. Abadi and V. Cortier, Deciding knowledge in security protocols under equational theories, Proc. 31st International Colloquium on Automata, Languages, and Programming, pp.46-58, 2004.
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00071420

R. Amadio and W. Charatonik, On Name Generation and Set-Based Analysis in the Dolev-Yao Model, Proc. International Conference on Concurrency Theory (CONCUR'02), pp.499-514, 2002.
DOI : 10.1007/3-540-45694-5_33

R. 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, 2002.
DOI : 10.1016/S0304-3975(02)00090-7
URL : https://hal.archives-ouvertes.fr/inria-00072478

R. Anderson and R. Needham, Programming Satan's computer, Computer Science Today: Recent Trends and Developments, pp.426-440, 1995.
DOI : 10.1007/BFb0015258

G. Ateniese, M. Steiner, and G. Tsudik, New multiparty authentication services and key agreement protocols, IEEE Journal on Selected Areas in Communications, vol.18, issue.4, pp.628-639, 2000.
DOI : 10.1109/49.839937

S. M. Bellovin, Problem areas for the IP security protocols, Proc. 6th USENIX Security Symposium, pp.1-16, 1996.

J. Benaloh, Secret sharing homomorphisms: Keeping shares of a secret sharing, Proc. Advances in Cryptology (CRYPTO'86), pp.251-260, 1987.

S. Bistarelli, I. Cervesato, G. Lenzini, and F. Martinelli, Relating multiset rewriting and process algebras for security protocol analysis, Proc. 3rd Workshop on Issues in the Theory of Security (WITS'03), 2003.
DOI : 10.3233/JCS-2005-13102

B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.82-96, 2001.
DOI : 10.1109/CSFW.2001.930138
URL : http://www.mpi-sb.mpg.de/~blanchet/publications/./BlanchetCSFW01.ps.gz

B. Blanchet, Cryptographic Protocol Verifier User Manual, 2004.
DOI : 10.1109/csfw.2001.930138
URL : http://www.mpi-sb.mpg.de/~blanchet/publications/./BlanchetCSFW01.ps.gz

B. Blanchet and A. Podelski, Verification of cryptographic protocols: Tagging enforces termination, Proc. 6th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'03), pp.136-152, 2003.
DOI : 10.1016/j.tcs.2004.10.018
URL : https://doi.org/10.1016/j.tcs.2004.10.018

M. Boreale, Symbolic Trace Analysis of Cryptographic Protocols, Proc. 28th International Colloquium on Automata, Languages, and Programming (ICALP'01), pp.667-681, 2001.
DOI : 10.1007/3-540-48224-5_55

M. Boreale and M. G. Buscemi, Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation, Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), pp.269-278, 2003.
DOI : 10.1007/978-3-540-45138-9_21

N. Borisov, I. Goldberg, and D. Wagner, Intercepting mobile communications, Proceedings of the 7th annual international conference on Mobile computing and networking , MobiCom '01, pp.180-188, 2001.
DOI : 10.1145/381677.381695

L. Bozga, C. Ene, and Y. Lakhnech, A symbolic decision procedure for cryptographic protocols with time stamps, Proc. 15th International Conference on Concurrency Theory, pp.177-192, 2004.

J. Bull and D. J. Otway, The authentication protocol, 1997.

M. Burrows, M. Abadi, and R. Needham, A logic of authentication, Proc. 12th ACM Symposium on Operating System Principles (SOSP'89), pp.1-13, 1989.

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, An NP decision procedure for protocol insecurity with XOR, Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pp.261-270, 2003.
DOI : 10.1109/lics.2003.1210066
URL : https://hal.archives-ouvertes.fr/inria-00103954

Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, Deciding the Security of Protocols with Commuting Public Key Encryption, Proc. Workshop on Automated Reasoning for Security Protocol Analysis, pp.53-63, 2004.
DOI : 10.1016/j.entcs.2004.05.019
URL : https://hal.archives-ouvertes.fr/inria-00100013

Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron, Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents, Proc. 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'03), 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, M. Turuani, and L. Vigneron, Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions, Proc. 17th International Workshop in Computer Science Logic (CSL'03), pp.128-141, 2003.
DOI : 10.1007/978-3-540-45220-1_13
URL : https://hal.archives-ouvertes.fr/inria-00071714

Y. Chevalier and L. Vigneron, Automated Unbounded Verification of Security Protocols, Proc. 14th International Conference on Computer Aided Verification (CAV'02), pp.324-337, 2002.
DOI : 10.1007/3-540-45657-0_24
URL : https://hal.archives-ouvertes.fr/inria-00100916

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

J. Cohen and M. Fischer, A robust and verifiable cryptographically secure election scheme, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.372-382, 1985.
DOI : 10.1109/SFCS.1985.2
URL : http://research.microsoft.com/crypto/papers/elect.ps

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, vol.331, issue.1, 2001.
DOI : 10.1016/j.tcs.2004.09.036
URL : https://hal.archives-ouvertes.fr/inria-00000553

H. Comon-lundh, Intruder Theories (Ongoing Work), Proc. 7th International Conference on Foundations of Software Science and Computation Structures, pp.1-4, 2004.
DOI : 10.1007/978-3-540-24727-2_1

H. Comon-lundh and V. Cortier, New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols, Proc. 14th International Conference on Rewriting Techniques and Applications (RTA'2003), pp.148-164, 2003.
DOI : 10.1007/3-540-44881-0_12

H. Comon-lundh and V. Shmatikov, 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

H. Comon-lundh and R. Treinen, Easy intruder deductions In Verification: Theory & Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, LNCS, vol.2772, pp.225-242, 2003.

R. Cramer, I. Damgård, and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Proc. 14th Annual International Cryptology Conference (CRYPTO'94), pp.174-187, 1994.
DOI : 10.1007/3-540-48658-5_19

R. Cramer, M. K. Franklin, B. Schoenmakers, and M. Yung, Multi-Authority Secret-Ballot Elections with Linear Work, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'96), pp.72-83, 1996.
DOI : 10.1007/3-540-68339-9_7

R. Cramer, R. Gennaro, and B. Schoenmakers, A secure and optimally efficient multi-authority election scheme, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'97, pp.103-118, 1997.
DOI : 10.1002/ett.4460080506

R. M. Dolev and S. Even, On the security of ping-pong protocols, Proc. Advances in Cryptology (CRYPTO'82), pp.177-186, 1983.

M. D. Davis and E. J. Weyuker, Computability, complexity and languages, Computer Science and Applied Mathematics, issue.7, pp.128-132, 1983.

S. Delaune and F. Jacquemard, 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

H. Delfs and H. Knebl, Introduction to Cryptography : Principles and Applications, 2002.

G. Delzanno and P. Ganty, Automatic Verification of Time Sensitive Cryptographic Protocols, Proc. 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.342-356, 2004.
DOI : 10.1007/978-3-540-24730-2_27
URL : http://software.imdea.org/~pierreganty/mypubs/dg-tacas04.pdf

D. E. Denning and G. M. Sacco, Timestamps in key distribution protocols, Communications of the ACM, vol.24, issue.8, pp.533-536, 1981.
DOI : 10.1145/358722.358740

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638
URL : http://www.cs.rutgers.edu/~tdnguyen/classes/cs671/presentations/Arvind-NEWDIRS.pdf

W. Diffie and M. Hellman, Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard, Computer, vol.10, issue.6, pp.74-84, 1977.
DOI : 10.1109/C-M.1977.217750

N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov, Undecidability of bounded security protocols, Proc. Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.

N. Evans and S. Schneider, Analysing Time Dependent Security Properties in CSP Using PVS, Proc. 6th European Symposium on Research in Computer Security (ESORICS'00), pp.222-237, 2000.
DOI : 10.1007/10722599_14
URL : http://www.dcs.rhbnc.ac.uk/research/formal/steve/papers/timepvs.ps.gz

S. Even and O. Goldreich, On the security of multi-party ping-pong protocols, Proc. 24th Annual Symposium on Foundations of Computer Science (FOCS'83), pp.34-39, 1983.

S. Even, O. Goldreich, and A. Shamir, On the security of ping-pong protocols when implemented using the RSA, Proc. Advances in Cryptology (CRYPTO'85), pp.58-72, 1986.

P. Fouque, G. Poupard, and J. Stern, Sharing Decryption in the Context of Voting or Lotteries, Proc. 4th International Conference on Financial Cryptography (FC'00), pp.90-104, 2001.
DOI : 10.1007/3-540-45472-1_7
URL : https://hal.archives-ouvertes.fr/inria-00565275

O. Goldreich, Foundations of Cryptography, 2001.
DOI : 10.1017/cbo9780511546891

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9
URL : https://doi.org/10.1016/0022-0000(84)90070-9

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, Proc. 17th annual ACM Symposium on Theory of Computing, pp.291-304, 1985.

L. Gong, Using one-way functions for authentication, ACM SIGCOMM Computer Communication Review, vol.19, issue.5, pp.8-11, 1989.
DOI : 10.1145/74681.74682
URL : http://www.javasoft.com/people/gong/papers/one-way.ps.gz

J. Goubault-larrecq, M. Roger, and K. N. Verma, Abstraction and resolution modulo AC: How to verify Diffie???Hellman-like protocols automatically, The Journal of Logic and Algebraic Programming, vol.64, issue.2, 2004.
DOI : 10.1016/j.jlap.2004.09.004
URL : https://doi.org/10.1016/j.jlap.2004.09.004

T. Hwang and Y. Chen, On the security of SPLICE/AS ??? The authentication system in WIDE Internet, Information Processing Letters, vol.53, issue.2, pp.91-101, 1995.
DOI : 10.1016/0020-0190(94)00175-X

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Compiling and Verifying Security Protocols, Proc. of 7th International Conference on Logic for Programming and Automated Reasoning (LPAR'00), pp.131-160, 2000.
DOI : 10.1007/3-540-44404-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072712

M. Jakobsson and D. Pointcheval, Mutual Authentication for Low-Power Mobile Devices, Proc. 5th International Conference on Financial Cryptography (FC'01), pp.178-195, 2002.
DOI : 10.1007/3-540-46088-8_17
URL : http://www.di.ens.fr/users/pointche/Documents/Papers/2001_fcB.pdf

D. Johnson, A. Menezes, and S. Vanstone, The Elliptic Curve Digital Signature Algorithm (ECDSA), International Journal of Information Security, vol.1, issue.1, 1999.
DOI : 10.1007/s102070100002
URL : http://cacr.math.uwaterloo.ca/~ajmeneze/publications/ecdsa.ps

D. Kapur, P. Narendran, and L. Wang, An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation, Proc. 14th International Conference on Rewriting Techniques and Applications (RTA'2003), pp.165-179, 2003.
DOI : 10.1007/3-540-44881-0_13

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

S. Kremer and M. Ryan, Analysing the Vulnerability of Protocols to Produce Known-pair and Chosen-text Attacks, Proc. 2nd International Workshop on Security Issues in Coordination Models, Languages and Systems, 2005.
DOI : 10.1016/j.entcs.2004.11.043

T. Kwon, Summary of AMP (authentication and key agreement via memorable passwords) Draft Document, 2003.

P. Lafourcade, D. Lugiez, and R. Treinen, Intruder Deduction for AC-Like Equational Theories with Homomorphisms, Proc. 16th International Conference on Rewriting Techniques and Applications (RTA'05), 2005.
DOI : 10.1007/978-3-540-32033-3_23

G. Lowe, An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters, vol.56, issue.3, pp.131-133, 1995.
DOI : 10.1016/0020-0190(95)00144-2
URL : http://web.comlab.ox.ac.uk/oucl/work/gavin.lowe/Security/Papers/NSPKP.ps

G. Lowe, Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR, Proc. 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), pp.147-166, 1996.
DOI : 10.1007/3-540-61042-1_43
URL : http://www.cs.ubc.ca/~ajh/courses/cpsc513/NSFDR.ps

G. Lowe, Casper: A compiler for the analysis of security protocols, Proc. 10th Computer Security Foundations Workshop (CSFW'97, pp.18-30, 1997.

G. Lowe, Towards a completeness result for model checking of security protocols, Proc. 11th Computer Security Foundations Workshop (CSFW'98), pp.96-106, 1998.

G. Lowe, Analysing protocols subject to guessing attacks, Proc. of the Workshop on Issues in the Theory of Security (WITS'02), 2002.
DOI : 10.3233/JCS-2004-12104
URL : http://web.comlab.ox.ac.uk/oucl/work/gavin.lowe/Security/Papers/guessingJCS.ps

G. Lowe and A. W. Roscoe, Using CSP to detect errors in the TMN protocol, IEEE Transactions on Software Engineering, vol.23, issue.10, pp.659-669, 1997.
DOI : 10.1109/32.637148

C. Lynch and C. Meadows, On the Relative Soundness of the Free Algebra Model for Public Key Encryption, Proc. 4th Workshop on Issues in the Theory of Security, pp.81-95, 2004.
DOI : 10.1016/j.entcs.2004.05.018

P. Mackenzie, More Efficient Password-Authenticated Key Exchange, Proc. Cryptographer's Track at RSA Conference, pp.361-377, 2001.
DOI : 10.1007/3-540-45353-9_27

P. Mckenzie, S. Patel, and R. Swaminathan, Password-authenticated key exchange based on RSA, Proc. 6th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'00), pp.599-613, 2000.

C. Meadows, Language generation and verification in the NRL protocol analyzer, Proc. 9th Computer Seurity Foundation Workshop (CSFW'96), pp.48-62, 1996.

C. Meadows, Extending formal cryptographic protocol analysis techniques for group protocols and low-level cryptographic primitives, Proc. 1st Workshop on Issues in the Theory of Security, pp.87-92, 2000.
DOI : 10.21236/ADA464085

C. Meadows, Towards a hierarchy of cryptographic protocol models, Proc. Workshop on Formal Methods in Security Engineering (FMSE'03), 2003.

J. Millen, On the freedom of decryption, Information Processing Letters, vol.86, issue.6, pp.329-333, 2003.
DOI : 10.1016/S0020-0190(03)00211-4

J. 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, 2001.
DOI : 10.1145/501983.502007

J. Millen and V. Shmatikov, Symbolic protocol analysis with products and Diffie-Hellman exponentiation, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., pp.47-62, 2003.
DOI : 10.1109/CSFW.2003.1212704

V. S. Miller, Use of Elliptic Curves in Cryptography, Proc. Advances in Cryptology, pp.417-426, 1986.
DOI : 10.1007/3-540-39799-X_31

J. C. Mitchell, M. Mitchell, and U. Stern, Automated analysis of cryptographic protocols using Mur?, Proc. 1997 IEEE Symposium on Security and Privacy, pp.141-151, 1997.
DOI : 10.1109/secpri.1997.601329

D. Naccache and J. Stern, A New Public-Key Cryptosystem, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'97), pp.27-37, 1997.
DOI : 10.1007/3-540-69053-0_3

N. Security and A. , SKIPJACK and KEA algorithm secification,Version 2, 1998.

R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, vol.21, issue.12, pp.993-999, 1978.
DOI : 10.1145/359657.359659

T. Okamoto and S. Uchiyama, A new public-key cryptosystem as secure as factoring, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'98), pp.308-318, 1998.
DOI : 10.1007/BFb0054135
URL : http://www.di.ens.fr/~pointche/proposals/Documents/OkUc98.ps.gz

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'99)Czech Republic), pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16

L. Paulson, Mechanized proofs for a recursive authentication protocol, Proceedings 10th Computer Security Foundations Workshop, pp.84-95, 1997.
DOI : 10.1109/CSFW.1997.596790
URL : ftp://ftp.cl.cam.ac.uk/papers/reports/TR418-lcp-recur.ps.gz

O. Pereira and J. Quisquater, On the perfect encryption assumption, Proc. 1st Workshop on Issues in the Theory of Security, pp.42-45, 2000.

O. Pereira and J. Quisquater, A security analysis of the cliques protocols suites, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.73-81, 2001.
DOI : 10.1109/CSFW.2001.930137

R. Ramanujam and S. P. Suresh, A decidable subclass of unbounded security protocols, Proc. IFIP Workshop on Issues in the Theory of Security (WITS'03), pp.11-20, 2003.

R. Ramanujam and S. P. Suresh, Tagging Makes Secrecy Decidable with Unbounded Nonces as Well, Proc. 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'03), pp.363-374, 2003.
DOI : 10.1007/978-3-540-24597-1_31
URL : http://www.cmi.ac.in/~spsuresh/pdffiles/fsttcs03.pdf

M. Rusinowitch and M. Turuani, 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

P. Y. Ryan and S. A. Schneider, An attack on a recursive authentication protocol A cautionary tale, Information Processing Letters, vol.65, issue.1, pp.7-10, 1998.
DOI : 10.1016/S0020-0190(97)00180-4

M. Satyanarayanan, Integrating security in a large distributed system, ACM Transactions on Computer Systems, vol.7, issue.3, pp.247-280, 1989.
DOI : 10.1145/65000.65002

B. Schneier, Applied Cryptography, 1996.

H. Seidl and K. N. Verma, Flat and one-variable clauses, Proc. of 11thth International Conference on Logic for Programming and Automated Reasoning (LPAR'04), LNCS, p. To appear, 2005.
DOI : 10.1145/1380572.1380577

V. Shmatikov, Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation, Proc. 13th European Symposium On Programming, pp.355-369, 2004.
DOI : 10.1007/978-3-540-24725-8_25

V. Shoup and A. Rubin, Session Key Distribution Using Smart Cards, Proc. International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'96), pp.321-330, 1996.
DOI : 10.1007/3-540-68339-9_28
URL : http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/E96/321.PDF

G. Simmons, Cryptanalysis and protocol failures, Communications of the ACM, vol.37, issue.11, pp.56-65, 1994.
DOI : 10.1145/188280.188298

M. E. Smid and D. K. Branstad, Data Encryption Standard: past and future, Proc. IEEE, pp.550-559, 1988.
DOI : 10.1109/5.4441

M. Steiner, G. Tsudik, and M. Waidner, Diffie-Hellman key distribution extended to group communication, Proceedings of the 3rd ACM conference on Computer and communications security , CCS '96, pp.31-37, 1996.
DOI : 10.1145/238168.238182
URL : http://www.isi.edu/~gts/CLIQUES/paper/stw96.ps.gz

M. Tatebayashi, N. Matsuzaki, and D. B. Newman, Key Distribution Protocol for Digital Mobile Communication Systems, Proc. 9th Annual International Cryptology Conference (CRYPTO'89), pp.324-333, 1989.
DOI : 10.1007/0-387-34805-0_30

M. Turuani, Sécurité des protocoles cryptographiques: décidabilité et complexité, 2003.

K. N. Verma, Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties, Proc. 14th International Conference on Rewriting Techniques and Applications (RTA'03), pp.180-196, 2003.
DOI : 10.1007/3-540-44881-0_14

D. S. Wong and A. H. Chan, Efficient and mutually authenticated key exchange protocol for low power computing devices, Proc. 7th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'01), pp.272-289, 2001.

T. Wu, The secure remote password protocol, Proc. 1998 Internet Society Network and Distributed System Security Symposium, pp.97-111, 1998.