An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.82-96, 2001. ,
DOI : 10.1109/CSFW.2001.930138
Protocol insecurity with finite number of sessions is NPcomplete, Proc. 14th Computer Security Foundations Workshop (CSFW'01, pp.174-190, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00100411
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.271-280, 2003. ,
DOI : 10.1109/LICS.2003.1210067
Cryptographically verified implementations for TLS, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.459-468, 2008. ,
DOI : 10.1145/1455770.1455828
Analysis of an electronic voting protocol in the applied picalculus, Proc. 14th European Symposium On Programming (ESOP'05), ser. LNCS, pp.186-200, 2005. ,
Analysis of an internet voting protocol, Cryptology ePrint Archive Report, vol.380, 2010. ,
Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.331-340, 2005. ,
DOI : 10.1109/LICS.2005.8
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
Trace equivalence decision, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, 2011. ,
DOI : 10.1145/2046707.2046744
Automated verification of equivalence properties of cryptographic protocols, 21th European Symposium on Programming (ESOP'12), ser. LNCS, pp.108-127, 2012. ,
URL : https://hal.archives-ouvertes.fr/inria-00632564
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus, 2008 21st IEEE Computer Security Foundations Symposium, pp.195-209, 2008. ,
DOI : 10.1109/CSF.2008.26
Reduction of equational theories for verification of trace equivalence: re-encryption and ac, First Conference on Principles of Security and Trust (POST'12), pp.169-188, 2012. ,
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
Practical Everlasting Privacy, Proceedings of the 2nd Conferences on Principles of Security and Trust (POST'13), ser. LNCS, pp.21-40, 2013. ,
DOI : 10.1007/978-3-642-36830-1_2
URL : https://hal.archives-ouvertes.fr/hal-00878630
A formal analysis of the Norwegian E-voting protocol, Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), ser. LNCS, pp.109-128, 2012. ,
DOI : 10.3233/JCS-15777
URL : https://hal.archives-ouvertes.fr/inria-00636115
Mobile values, new names, and secure communication, Proc. 28th ACM Symp. on Principles of Programming Languages (POPL'01, pp.104-115, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-01423924
Receipt-free electronic voting schemes for large scale elections, Proc. 5th Int. Security Protocols Workshop, ser. LNCS, pp.25-35, 1997. ,
DOI : 10.1007/BFb0028157
Helios: web-based open-audit voting, " in 17th conference on Security symposium (SS'08) USENIX Association, pp.335-348, 2008. ,
Election Verifiability for Helios under Weaker Trust Assumptions, 19th European Symp. on Research in Computer Security (ESORICS'14), ser. LNCS, pp.327-344, 2014. ,
DOI : 10.1007/978-3-319-11212-1_19
URL : https://hal.archives-ouvertes.fr/hal-01080292
Pr??t ?? Voter with Re-encryption Mixes, 11th European Symp. On Research In Computer Security (ESORICS'06), ser. LNCS, pp.313-326, 2006. ,
DOI : 10.1007/11863908_20
Defining Privacy for Weighted Votes, Single and Multi-voter Coercion, 17th European Symp. On Research In Computer Security (ES- ORICS'06), ser, 2012. ,
DOI : 10.1007/978-3-642-33167-1_26
URL : https://hal.archives-ouvertes.fr/hal-01338037
A practical secret voting scheme for large scale elections, Advances in Cryptology ? AUSCRYPT '92, ser. LNCS, pp.244-251, 1992. ,
DOI : 10.1007/3-540-57220-1_66
Security properties: two agents are sufficient, Science of Computer Programming, vol.50, issue.1-3, pp.51-71, 2004. ,
DOI : 10.1016/j.scico.2003.12.002
URL : https://hal.archives-ouvertes.fr/inria-00099981
Bounding the Number of Agents, for??Equivalence Too, Proceedings of the 5th International Conference on Principles of Security and Trust (POST'16), ser, 2016. ,
DOI : 10.1145/358722.358740
URL : https://hal.archives-ouvertes.fr/hal-01361286
Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.3-51, 2008. ,
DOI : 10.1109/LICS.2005.8
When are three voters enough for privacy properties? Cryptology ePrint Archive, 2016. ,
SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions, 2015 IEEE Symposium on Security and Privacy, pp.499-516, 2015. ,
DOI : 10.1109/SP.2015.37
Running mixnet-based elections with helios, 2011 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, EVT/WOTE '11. USENIX Association, 2011. ,
Coercion-resistant electronic elections, Proceedings of the 2005 ACM workshop on Privacy in the electronic society , WPES '05, pp.61-70, 2005. ,
DOI : 10.1145/1102199.1102213
Civitas: Toward a Secure Voting System, 2008 IEEE Symposium on Security and Privacy (sp 2008), pp.354-368, 2008. ,
DOI : 10.1109/SP.2008.32
Proving More Observational Equivalences with ProVerif, Proc. 2nd International Conference on Principles of Security and Trust (POST'13), ser. LNCS, pp.226-246, 2013. ,
DOI : 10.1007/978-3-642-36830-1_12
URL : https://hal.archives-ouvertes.fr/hal-00863377