M. Abadi and C. Fournet, Mobile Values, New names, and Secure Communication, 28th ACM Symposium on Principles of Programming Languages (POPL), 2001.
DOI : 10.1145/360204.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

M. Arapinis, S. Bursuc, and M. Ryan, Reduction of equational theories for verification of trace equivalence: re-encryption and AC, First International Conference on Principles of Security and Trust (POST'12, 2012.

M. Arapinis, V. Cortier, and S. Kremer, When Are Three Voters Enough for Privacy Properties?, Proceedings of the 21st European Symposium on Research in Computer Security (ESORICS'16), 2016.
DOI : 10.1007/978-3-642-36830-1_12
URL : https://hal.archives-ouvertes.fr/hal-01351398

A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna et al., Viganò , and Laurent Vigneron. The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, 17th International Conference on Computer Aided Verification (CAV), 2005.

D. Basin, J. Dreier, and R. Sasse, Automated Symbolic Proofs of Observational Equivalence, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, p.2015
DOI : 10.1007/978-3-540-79966-5_1
URL : https://hal.archives-ouvertes.fr/hal-01337409

J. Benaloh, M. D. Byrne, B. Eakin, P. T. Kortum, N. Mcburnett et al., Star-vote: A secure, transparent, auditable, and reliable voting system, 2013 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, p.2013

D. Bernhard, V. Cortier, O. Pereira, B. Smyth, and B. Warinschi, Adapting Helios for Provable Ballot Secrecy, 16th European Symposium on Research in Computer Security (ESORICS), 2011.
DOI : 10.1007/978-3-642-23822-2_19
URL : https://hal.archives-ouvertes.fr/inria-00638554

D. Bernhard, O. Pereira, and B. Warinschi, How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios, International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), 2012.
DOI : 10.1007/978-3-642-34961-4_38

K. Bhargavan, R. Corin, C. Fournet, and E. Zalinescu, Cryptographically verified implementations for TLS, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, 2008.
DOI : 10.1145/1455770.1455828

B. Blanchet, An Automatic Security Protocol Verifier based on Resolution Theorem Proving (invited tutorial), 20th International Conference on Automated Deduction (CADE), 2005.

B. Blanchet, Vérification Automatique de Protocoles Cryptographiques: Modèle Formel et Modèle Calculatoire Mémoire d'habilitation à diriger des recherches, 2008.

B. Blanchet, M. Abadi, and C. Fournet, Automated Verification of Selected Equivalences for Security Protocols, Journal of Logical and Algebraic Methods in Programming, 2008.

R. Chadha and S. Kremer, Automated verification of equivalence properties of cryptographic protocols, 21th European Symposium on Programming, p.2012
URL : https://hal.archives-ouvertes.fr/hal-00732905

D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc et al., Corrections to ???Scantegrity II: End-to-End Verifiability by Voters of Optical Scan Elections Through Confirmation Codes??? [Dec 09 611-627, IEEE Transactions on Information Forensics and Security, vol.5, issue.1, p.194, 2010.
DOI : 10.1109/TIFS.2010.2040672

V. Cheval, H. Comon-lundh, and S. Delaune, Trace equivalence decision, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, 2011.
DOI : 10.1145/2046707.2046744

V. Cortier and S. Delaune, A Method for Proving Observational Equivalence, 2009 22nd IEEE Computer Security Foundations Symposium, 2009.
DOI : 10.1109/CSF.2009.9
URL : https://hal.archives-ouvertes.fr/inria-00426622

V. Cortier and B. Smyth, Attacking and fixing Helios: An analysis of ballot secrecy, Journal of Computer Security, 2013.
DOI : 10.1109/csf.2011.27
URL : https://hal.archives-ouvertes.fr/hal-00732899

V. Cortier and C. Wiedling, A formal analysis of the Norwegian E-voting protocol, First International Conference on Principles of Security and Trust (POST), 2012.
URL : https://hal.archives-ouvertes.fr/hal-00732907

R. Cramer, R. Gennaro, and B. Schoenmakers, A Secure and Optimally Efficient Multi- Authority Election Scheme, International Conference on the Theory and Application of Cryptographic Techniques (EuroCrypt), 1997.
DOI : 10.1007/3-540-69053-0_9

C. Cremers, The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols, 20th International Conference of Computer Aided Verification (CAV), 2008.
DOI : 10.1007/978-3-540-70545-1_38

S. Delaune, S. Kremer, and M. Ryan, Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, 2009.
DOI : 10.3233/JCS-2009-0340
URL : http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-01.pdf

A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, 1992.
DOI : 10.1007/3-540-57220-1_66

K. Gjøsteen, Analysis of an Internet Voting Protocol, Cryptology ePrint Archive Report, vol.380, 2010.

K. Gjøsteen, The norwegian internet voting protocol. Cryptology ePrint Archive, 2013.

A. Halderman and V. Teague, The New South Wales iVote System: Security Failures and Verification Flaws in a Live Online Election, 5th International Conference on E-voting and Identity (VoteID'15), 2015.
DOI : 10.1007/978-3-319-22270-7_3

D. Khader, Y. A. Peter, and . Ryan, Receipt freeness of prêt à voter provably secure, IACR Cryptology ePrint Archive, p.594, 2011.

P. Klus, B. Smyth, and M. D. Ryan, ProSwapper: Improved equivalence verifier for ProVerif (last seen: 08-26-16), 2010.

R. Küsters and T. Truderung, An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols, 2009 30th IEEE Symposium on Security and Privacy, 2009.
DOI : 10.1109/SP.2009.13