I. G. Klein, T. Nipkow, and L. Paulson, The Archive of Formal Proofs

M. Abadi and C. Fournet, Mobile Values, New Names, and Secure Communication, Proc. of the 28th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'01), pp.104-115, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01423924

G. Bella, Formal Correctness of Security Protocols. Information Security and Cryptography, 2007.

G. Bella, Inductive study of confidentiality: for everyone. Formal Aspects of Computing, pp.1-34, 2012.

G. Bella, F. Massacci, L. C. Paulson, and P. Tramontano, Formal Verification of Cardholder Registration in SET, Proc. of the 6th European Symposium on Research in Computer Security (ESORICS'00), LNCS 1895, pp.159-174, 2000.
DOI : 10.1007/10722599_10

G. Bella and L. C. Paulson, Mechanical Proofs about a Non-repudiation Protocol, Proc. of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'01), LNCS 2152, pp.91-104, 2001.
DOI : 10.1007/3-540-44755-5_8

B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.82-96, 1998.
DOI : 10.1109/CSFW.2001.930138

D. Butin and G. Bella, Verifying Privacy by Little Interaction and No Process Equivalence, SECRYPT, pp.251-256, 2012.

R. Chadha and S. Kremer, Automated Verification of Equivalence Properties of Cryptographic Protocols, LNCS, vol.7211, pp.108-127, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00632564

S. Delaune, S. Kremer, and M. Ryan, Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, pp.435-487, 2009.
DOI : 10.3233/JCS-2009-0340

S. Delaune, M. Ryan, and B. Smyth, Automatic verification of privacy properties in the applied pi calculus. Syntax, pp.263-278, 2008.

A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology (ASIACRYPT'92), pp.244-251, 1993.
DOI : 10.1007/3-540-57220-1_66

S. Kremer and M. Ryan, Analysis of an Electronic Voting Protocol in the Applied Pi Calculus, Proc. 14th European Symposium On Programming (ESOP'05), pp.186-200, 2005.
DOI : 10.1007/978-3-540-31987-0_14

J. E. Martina and L. C. Paulson, Verifying Multicast-Based Security Protocols Using the Inductive Method, Workshop on Formal Methods and Cryptography, 2011.

L. C. Paulson, Isabelle: A Generic Theorem Prover, LNCS, vol.828, 1994.
DOI : 10.1007/BFb0030541

L. C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security, vol.6, issue.1-2, pp.85-128, 1998.
DOI : 10.3233/JCS-1998-61-205

M. Ryan, Keynote: Analysing security properties of electronic voting systems. In´UIn´ In´U, ESSoS, pp.1-14, 2011.