M. Abadi, C. Fournet, and G. Gonthier, Secure Implementation of Channel Abstractions, Information and Computation, vol.174, issue.1, pp.37-83, 2002.
DOI : 10.1006/inco.2002.3086

M. Bellare, R. Canetti, and H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.419-428, 1998.
DOI : 10.1145/276698.276854

B. Blanchet and A. Podelski, Verification of cryptographic protocols: Tagging enforces termination, Foundations of Software Science and Computation Structures (FoSSaCS'03), 2003.

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

V. Cortier, H. Hördegen, and B. Warinschi, Explicit Randomness is not Necessary when Modeling Probabilistic Encryption, Workshop on Information and Computer Security, 2006.
DOI : 10.1016/j.entcs.2006.11.044
URL : https://hal.archives-ouvertes.fr/inria-00078825

V. Cortier and B. Warinschi, Computationally Sound, Automated Proofs for Security Protocols, Proc. 14th European Symposium on Programming (ESOP'05), 2005.
DOI : 10.1007/978-3-540-31987-0_12
URL : https://hal.archives-ouvertes.fr/inria-00000556

A. Datta, A. Derek, J. C. Mitchell, and D. Pavlovic, A derivation system and compositional logic for security protocols, Journal of Computer Security, vol.13, issue.3, pp.423-482, 2005.
DOI : 10.3233/JCS-2005-13304

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

O. Goldreich, S. Micali, and A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.218-229, 1987.
DOI : 10.1145/28395.28420

L. Gong and P. Syverson, Fail-stop protocols: An approach to designing secure protocols, Proceedings of the 5th International Working Conference on Dependable Computing for Critical Applications (DCCA-5), pp.44-55, 1995.

J. Katz and M. Yung, Scalable protocols for authenticated group key exchange, Proceedings of Crypto'03, pp.110-125, 2003.

G. Lowe, Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.147-166, 1996.
DOI : 10.1007/3-540-61042-1_43

G. Lowe, A hierarchy of authentication specifications, Proceedings 10th Computer Security Foundations Workshop, 1997.
DOI : 10.1109/CSFW.1997.596782

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

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.

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