M. Abadi and A. D. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, 1997.
DOI : 10.1145/266420.266432

R. Amadio and W. Charatonik, On name generation and setbased analysis in the Dolev-Yao model, Proceedings of the 13th International Conference on Concurrency Theory (CONCUR), 2002.

R. Amadio and D. Lugiez, On the Reachability Problem in Cryptographic Protocols, Proceedings of the 12th International Conference on Concurrency Theory (CONCUR), 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, Proceedings of Advances in Cryptology (EUROCRYPT), 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, 1992.
DOI : 10.1109/RISP.1992.213269

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

Y. Chevalier, R. Kuester, 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., 2003.
DOI : 10.1109/LICS.2003.1210066

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

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, 2003.
DOI : 10.1016/j.tcs.2004.09.036

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

H. Comon-lundh and V. Shmatikov, Constraint solving, exclusive or and the decision of confidentiality for security protocols assuming a bounded number of sessions, Proceedings of Logic in Computer Science (LICS), 2003.

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

S. Delaune and F. Jacquemard, A theory of guessing attacks and its complexity. Research Report LSV-04-1, Lab. Specification and Verification, 2004.

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

N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov, Undecidability of bounded security protocols, Proceedings of Workshop on Formal Methods and Security Protocols, 1999.

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

S. Goldwasser and S. Miscali, Probabilistic encryption, Journal of Computer and System Sciences, 1984.
DOI : 10.1016/0022-0000(84)90070-9

URL : http://doi.org/10.1016/0022-0000(84)90070-9

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, 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, Computational Logic. Essays in honor of Alan Robinson, 1991.

J. Katz, R. Ostrovsky, and M. , Yung Efficient passwordauthenticated key exchange using human-memorable passwords, Proceedings of Advances in Cryptology (EURO- CRYPT), 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, Proceedings of the Workshop on Issues in the Theory of Security (WITS), 2002.
DOI : 10.3233/JCS-2004-12104

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

J. Millen and V. Shmatikov, Constraint solving for boundedprocess cryptographic protocol analysis, Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS), 2001.
DOI : 10.1145/501983.502007

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

M. Rusinowitch and M. Turuani, Protocol insecurity with finite number of sessions is NP-complete, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., 2001.
DOI : 10.1109/CSFW.2001.930145

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

J. G. Steiner, C. Neuman, and J. Schiller, Kerberos: An authentication service for open network systems, Proceedings of the Winter 1988 Usenix Conference, 1988.

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

T. Wu, The secure remote password protocol, Proceedings of the Internet Society Network and Distributed System Security Symposium, 1998.