M. Abadi, B. Blanchet, and C. Fournet, The Applied Pi Calculus, Journal of the ACM, vol.65, issue.1, pp.1-41, 2017.
DOI : 10.1109/SFCS.1982.45

URL : https://hal.archives-ouvertes.fr/hal-01423924

M. Abadi and C. Fournet, Private authentication, Theoretical Computer Science, vol.322, issue.3, pp.427-476, 2004.
DOI : 10.1016/j.tcs.2003.12.023

URL : http://cs.ucsb.edu/~ravenben/papers/prelims/logicofauth.pdf

B. Adida, Helios: web-based open-audit voting, Proc. 17th USENIX Security Symposium (USENIX'08), pp.335-348, 2008.

M. Arapinis, T. Chothia, E. Ritter, and M. D. Ryan, Analysing Unlinkability and Anonymity Using the Applied Pi Calculus, 2010 23rd IEEE Computer Security Foundations Symposium, pp.107-121, 2010.
DOI : 10.1109/CSF.2010.15

M. Arapinis, V. Cortier, and S. Kremer, When Are Three Voters Enough for Privacy Properties?, Proc. 21st European Symposium on Research in Computer Security (ESORICS'16), pp.241-260, 2016.
DOI : 10.1007/978-3-642-36830-1_12

URL : https://hal.archives-ouvertes.fr/hal-01351398

M. Arapinis, L. Mancini, E. Ritter, M. Ryan, N. Golde et al., New privacy issues in mobile telephony, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.205-216, 2012.
DOI : 10.1145/2382196.2382221

D. Baelde, S. Delaune, and L. Hirschi, Partial order reduction for security protocols, Proc. 26th International Conference on Concurrency Theory (CON- CUR'15), volume 42 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.497-510, 2015.

D. A. 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, pp.1144-1155, 2015.
DOI : 10.1007/978-3-540-79966-5_1

URL : https://hal.archives-ouvertes.fr/hal-01337409

B. Blanchet, Modeling and verifying security protocols with the applied pi calculus and proverif. Foundations and Trends in Privacy and Security, pp.1-135, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01423760

B. Blanchet, M. Abadi, and C. Fournet, Automated Verification of Selected Equivalences for Security Protocols, Proc. Symposium on Logic in Computer Science (LICS'05), pp.331-340, 2005.

R. Chadha, V. Cheval, S. ¸. Ciobâc?, and S. Kremer, Automated verification of equivalence properties of cryptographic protocol, ACM Transactions on Computational Logic, vol.23, issue.4, pp.1-32, 2016.

V. Cheval, APTE: An Algorithm for Proving Trace Equivalence, Proc. 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14), pp.587-592, 2014.
DOI : 10.1007/978-3-642-54862-8_50

V. Cheval, S. Kremer, and I. Rakotonirina, DEEPSEC: Deciding equivalence properties in security protocols -theory and practice, Proc. 39th IEEE Symposium on Security and Privacy (S&P'18), pp.525-542, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01698177

V. Cortier, S. Delaune, and A. Dallon, SAT-Equiv: An Efficient Tool for Equivalence Properties, 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp.481-494, 2017.
DOI : 10.1109/CSF.2017.15

URL : https://hal.archives-ouvertes.fr/hal-01624274

V. Cortier and B. Smyth, Attacking and fixing Helios: An analysis of ballot secrecy, Journal of Computer Security, vol.21, issue.1, pp.89-148, 2013.
DOI : 10.3233/JCS-2012-0458

URL : https://hal.archives-ouvertes.fr/hal-00732899

S. Delaune, S. Kremer, and M. D. 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

D. Dolev and A. Yao, On the security of public key protocols, Proc. 22nd Symp. on Foundations of Computer Science (FOCS'81), pp.350-357, 1981.

. Mathjax, Beautiful math in all browsers

. Pki-task-force, PKI for machine readable travel documents offering ICC read-only access International Civil Aviation Organization, 2004.

P. Y. Ryan and S. A. Schneider, Pr??t ?? Voter with Re-encryption Mixes, Proc. 11th European Symposium on Research in Computer Security (ESORICS'06), pp.313-326, 2006.
DOI : 10.1007/11863908_20

URL : http://www.cs.ncl.ac.uk/research/pubs/trs/papers/956.pdf

S. Santiago, S. Escobar, C. Meadows, and J. Meseguer, A Formal Definition of Protocol Indistinguishability and Its Verification Using Maude-NPA, Proc. 10th International Workshop on Security and Trust Management STM'14, pp.162-177, 2014.
DOI : 10.1007/978-3-319-11851-2_11

B. Schmidt, S. Meier, C. Cremers, and D. Basin, The TAMARIN prover for the symbolic analysis of security protocols, Proc. 25th International Conference on Computer Aided Verification (CAV'13), pp.696-701, 2013.

A. Tiu and J. Dawson, Automating Open Bisimulation Checking for the Spi Calculus, 2010 23rd IEEE Computer Security Foundations Symposium, pp.307-321, 2010.
DOI : 10.1109/CSF.2010.28

A. Tiu, N. Nguyen, and R. Horne, SPEC: An Equivalence Checker for Security Protocols, Proc. 14th Asian Symposium on Programming Languages and Systems (APLAS'16), pp.87-95, 2016.
DOI : 10.1109/CSF.2010.28