M. Abadi and V. Cortier, Deciding Knowledge in Security Protocols under Equational Theories, Proc. of the 31st International Colloquium on Automata , Languages, and Programming, pp.46-58, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00000554

M. Abadi and C. Fournet, Mobile Values, New Names, and Secure Communication, Proc. of the 28th ACM Symposium on Principles of Programming Languages (POPL'01, pp.104-115, 2001.
DOI : 10.1145/373243.360213

URL : https://hal.archives-ouvertes.fr/hal-01423924

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

R. Amadio and D. Lugiez, On the Reachability Problem in Cryptographic Protocols, Proc. of the 11th International Conference on Concurrency Theory (CONCUR'00) Pennsylvania (USA), pp.380-394, 2000.
DOI : 10.1007/3-540-44618-4_28

URL : https://hal.archives-ouvertes.fr/inria-00072738

M. Bellare, D. Pointcheval, and P. Rogaway, Authenticated Key Exchange Secure against Dictionary Attacks, Proc. of Advances in Cryptology (EUROCRYPT'00), pp.139-155, 2000.
DOI : 10.1007/3-540-45539-6_11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. M. Bellovin and M. Merritt, Encrypted key exchange: password-based protocols secure against dictionary attacks, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy, pp.72-84, 1992.
DOI : 10.1109/RISP.1992.213269

URL : http://academiccommons.columbia.edu/download/fedora_content/download/ac:127104/CONTENT/neke.pdf

B. Blanchet, Automatic proof of strong secrecy for security protocols, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004, pp.86-100, 2004.
DOI : 10.1109/SECPRI.2004.1301317

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. of the 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

E. Cohen, Proving Cryptographic Protocols Safe from Guessing Attacks, Proc. Foundations of Computer Security (FCS'02). Copenhagen, 2002.

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, vol.331, issue.1, pp.143-214, 2005.
DOI : 10.1016/j.tcs.2004.09.036

URL : https://hal.archives-ouvertes.fr/inria-00000553

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

R. Corin, J. Doumen, and S. Etalle, Analysing Password Protocol Security Against Off-line Dictionary Attacks, Proc. of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models, 2004.
DOI : 10.1016/j.entcs.2004.10.007

URL : http://doi.org/10.1016/j.entcs.2004.10.007

R. Corin, S. Malladi, J. Alves-foss, and S. Etalle, Guess what? Here is a new tool that finds some new guessing attacks, Proc. of the Workshop on Issues in the Theory of Security (WITS'03), 2003.

S. Delaune and F. Jacquemard, A theory of dictionary attacks and its complexity, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., pp.2-15, 2004.
DOI : 10.1109/CSFW.2004.1310728

URL : https://hal.archives-ouvertes.fr/inria-00579014

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.1-2, pp.69-116, 1987.
DOI : 10.1016/S0747-7171(87)80022-6

Y. Ding and P. Horster, Undetectable on-line password guessing attacks, ACM SIGOPS Operating Systems Review, vol.29, issue.4, pp.77-86, 1995.
DOI : 10.1145/219282.219298

D. Dolev and A. Yao, On the security of public key protocols, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.198-208, 1983.
DOI : 10.1109/SFCS.1981.32

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

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 : http://doi.org/10.1016/0022-0000(84)90070-9

L. Gong, Optimal Authentication Protocols Resistant to Password Guessing Attacks, Proc. of the 8th Computer Security Foundations Workshop (CSFW'95). Kenmare (Ireland), 1995.

L. Gong, T. M. Lomas, R. M. Needham, and J. H. Saltzer, Protecting poorly chosen secrets from guessing attacks, IEEE Journal on Selected Areas in Communications, vol.11, issue.5, pp.648-656, 1993.
DOI : 10.1109/49.223865

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Jouannaud and C. Kirchner, Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification'. In: Computational Logic -Essays in Honor of Alan Robinson, pp.257-321, 1991.

J. Katz, R. Ostrovsky, and M. Yung, Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords, Proc. of Advances in Cryptology (EUROCRYPT'01), pp.475-494, 2001.
DOI : 10.1007/3-540-44987-6_29

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

G. Lowe, Analysing protocols subject to guessing attacks, Journal of Computer Security, vol.12, issue.1, pp.83-98, 2004.
DOI : 10.3233/JCS-2004-12104

URL : http://doi.org/10.3233/jcs-2004-12104

D. A. Mcallester, Automatic recognition of tractability in inference relations, Journal of the ACM, vol.40, issue.2, pp.284-303, 1993.
DOI : 10.1145/151261.151265

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

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

J. G. Steiner, B. C. Neuman, and J. I. Schiller, Kerberos: An Authentication Service for Open Network Systems, Proc. of USENIX Winter Conference, pp.191-202, 1988.

F. J. Thayer, J. C. Herzog, and J. D. Guttman, Strand Spaces: Proving Security Protocols Correct, Journal of Computer Security, vol.7, issue.2, 1999.

G. Tsudik and E. V. Herreweghen, Some remarks on protecting weak keys and poorly-chosen secrets from guessing attacks, Proceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems, pp.136-141, 1993.
DOI : 10.1109/RELDIS.1993.393465

T. Wu, The Secure Remote Password Protocol, Proc. of Internet Society Symposium on Network and Distributed System Security, pp.97-111, 1998.