M. Abadi, Secrecy by typing in security protocols, Journal of the ACM, vol.46, issue.5, pp.749-786, 1999.
DOI : 10.1145/324133.324266
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.8514

A. R. Amadio and W. Charatonik, On Name Generation and Set-Based Analysis in the Dolev-Yao Model, Proc. CONCUR 02, pp.499-514, 2002.
DOI : 10.1007/3-540-45694-5_33

A. Roberto, M. Amadio, W. Charatonik, A. M. Abadi, and A. D. Gordon, On name generation and setbased analysis in the dolev-yao model A calculus for cryptographic protocols : The spi-calculus, CONCUR Proceedings of the 27-th ACM Symposium on Principles of Programming Languages (POPL'00) AN96. M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols, pp.499-514, 1996.

. Bea04, . Danì, and . Beauquier, Secrecy for cryptographic protocols is easy, Proceedings of SYNASC'04, 2004.

. B. Bla01 and . Blanchet, An efficient cryptographic protocol verifier based on prolog rules Verification of Cryptographic Protocols: Tagging Enforces Termination, Proceedings of the 14-th Computer Security Foundations Workshop (CSFW'01) Proceedings of FoSSaCS'03, pp.82-96, 2001.

H. Comon, V. Cortier, and J. Mitchell, Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols, Proc. of the Intern. Conf. on Automata, languagesand Programming (ICALP'01, pp.682-693, 2001.
DOI : 10.1007/3-540-48224-5_56

C. I. +-99, N. Cervesato, P. Durgin, J. C. Lincoln, A. Mitchell et al., A metanotation for protocol analysis, Proc. of the 12-th IEEE Computer Security Foundations Workshop, 1999.

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

D. N. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov, Multiset rewriting and the complexity of bounded security protocols, Journal of Computer Security, vol.12, issue.2, pp.677-722, 2004.
DOI : 10.3233/JCS-2004-12203

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

H. , J. Heather, G. Lowe, and S. Schneider, How to Prevent Type Flaw Attacks on Security Protocols Authentication tests and the structure of bundles, Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW 13), pp.255-268333, 2000.

. G. Gavin-lowe-low99 and . Lowe, Towards a completeness result for model checking of security protocols Using csp to detect errors in the tmn protocol The inductive approach to verifying cryptographic protocols Tagging makes secrecy decidable for unbounded nonces as well, Proceedings of 23rd FST&TCS, number 2914 in Lecture Notes in Computer Science, pp.131-13689, 1995.

. S. Sch97 and . Schneider, Verifying authentication protocols with csp, Proceedings of the 10-th Computer Security Foundations Workshop (CSFW'97, 1997.

M. Tatebayashi, N. Matsuzaki, and D. B. Newman, Key Distribution Protocol for Digital Mobile Communication Systems, Proceedings on Advances in cryptology: Proc. Crypto'89 Lect, pp.324-333, 1990.
DOI : 10.1007/0-387-34805-0_30