Automated verification of remote electronic voting protocols in the applied pi-calculus

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2008, Pages 195-209

  Backes, Michael ^a,b   Hriţcu, Cǎtǎlin ^a   Maffei, Matteo ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; DIFFERENTIATION (CALCULUS); ERROR ANALYSIS; FOUNDATIONS; MATHEMATICAL TECHNIQUES; REUSABILITY; SECURITY SYSTEMS; VOTING MACHINES;

COMPUTER SECURITY; ELECTRONIC VOTING PROTOCOLS; PI-CALCULUS;

COMPUTER NETWORKS;

EID: 51749097575     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2008.26     Document Type: Conference Paper

References (31)

1. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, 1999.
2. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In Proc. 4th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 2030 of Lecture Notes in Computer Science, pages 25-41. Springer-Verlag, 2001.
3. M. Abadi, B. Blanchet, and C. Fournet. Automated verification of selected equivalences for security protocols, 2007. To appear in Journal of Logic Algebric Programming.
4. M. Abadi, B. Blanchet, and C. Fournet. Just fast keying in the pi calculus. ACM Transactions on Information and System Security, 10(3):9, 2007.
5. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proc. 28th Symposium on Principles of Programming Languages (POPL), pages 104-115. ACM Press, 2001.
6. A. Acquisti. Receipt-free homomorphic elections and write-in ballots. Cryptology ePrint Archive, Report 2004/105, 2004. http://eprint.iacr.org/.
7. M. Backes, A. Cortesi, and M. Maffei. Causality-based abstraction of multiplicity in cryptographic protocols. In Proc. 20th IEEE Symposium on Computer Security Foundations (CSF), pages 355-369. IEEE Computer Society Press, 2007.
8. M. Backes, C. Hriţcu, and M. Maffei. ProVerif scripts for the Juels, Catalano, and Jakobsson protocol. Available at: www.infsec.cs.uni-sb.de/ ~maffei/ev.zip.
9. M. Backes, M. Maffei, and D. Unruh. Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol. To appear in IEEE Symposium on Security and Privacy, 2008.
10. J. Bannet, D. W. Price, A. Rudys, J. Singer, and D. S. Wallach. Hack-a-vote: Security issues with electronic voting systems. IEEE Security & Privacy, 2(1):32-37, 2004.
11. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), pages 544-553. ACM Press, 1994.
12. B. Blanchet. An efficient cryptographic protocol verifier based on Prolog rules. In Proc. 14th IEEE Computer Security Foundations Workshop (CSFW), pages 82-96. IEEE Computer Society Press, 2001.
13. B. Blanchet, M. Abadi, and C. Fournet. Automated verification of selected equivalences for security protocols. In Proc. 20th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 331-340. IEEE Computer Society Press, 2005.
14. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H. R. Nielson. Static validation of security protocols. Journal of Computer Security, 13(3):347-390, 2005.
15. M. Bugliesi, R. Focardi, and M. Maffei. Dynamic types for authentication. Journal of Computer Security, 15(6):563-617, 2007.
16. M. R. Clarkson, S. Chong, and A. C. Myers. Civitas: A secure voting system. To appear in IEEE Symposium on Security and Privacy, 2008.
17. S. Delaune, S. Kremer, and M. Ryan. Coercionresistance and receipt-freeness in electronic voting. In Proc. 19th IEEE Computer Security Foundations Workshop (CSFW), pages 28-42. IEEE Computer Society Press, 2006.
18. S. Delaune, S. Kremer, and M. Ryan. Symbolic bisimulation for the applied pi calculus. In In Proc. of Foundations of Software Technology and Theoretical Computer Science, 27th International Conference (FSTTCS 2007), Lecture Notes in Computer Science, pages 133-145. Springer-Verlag, 2007.
19. S. Delaune, S. Kremer, and M. Ryan. Verifying privacytype properties of electronic voting protocols. Research Report LSV-08-01, Laboratoire Spécification et Vérification, ENS Cachan, France, 2008.
20. S. Delaune, M. Ryan, and B. Smyth. Automatic verification of privacy properties in the applied pi calculus. To appear in 2nd Joint iTrust and PST Conferences on Privacy, Trust Management and Security (IFIPTM'08), 2008.
21. D. L. Dill, B. Schneier, and B. Simons. Voting and technology: who gets to count your vote? Communications of the ACM, 46(8):29-31, 2003.
22. S. Doghmi, J. Guttman, and F. Thayer. Searching for shapes in cryptographic protocols. In Proc. 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, pages 523-538. Springer-Verlag, 2007.
23. D. Evans and N. Paul. Election security: Perception and reality. IEEE Security & Privacy, 2(1):24-31, 2004.
24. A. D. Gordon and A. Jeffrey. Types and effects for asymmetric cryptographic protocols. Journal of Computer Security, 12(3):435-484, 2004.
25. A. Juels, D. Catalano, and M. Jakobsson. Coercionresistant electronic elections. In Proc. 4nd ACM Workshop on Privacy in the Electronic Society (WPES), pages 61-70. ACM Press, 2005.
26. T. Kohno, A. Stubblefield, A. D. Rubin, and D. S. Wallach. Analysis of an electronic voting system. In Proc. 25th IEEE Symposium on Security & Privacy, pages 27-42. IEEE Computer Society Press, 2004.
27. T. Krivoruchko. Robust coercion-resistant registration for remote e-voting. IAVoSS Workshop On Trustworthy Elections (WOTE 2007), June 2007. Available at: http://research.microsoft.com/conferences/WOTE2007/papers/09.pdf.
28. C. R. Nielsen, E. H. Andersen, and H. R. Nielson. Static validation of a voting protocol. In Automated Reasoning for Security Protocol Analysis (ARSPA 2005), volume 135 of Electronic Notes on Theoretical Computer Science, pages 115-134. Elsevier Science Publishers Ltd., 2005.
29. A. D. Rubin. Security considerations for remote electronic voting. Communications of the ACM, 45(12):39-44, 2002.
30. S. G. Weber, R. Araujo, and J. Buchmann. On coercionresistant electronic elections with linear work. In ARES '07: Proceedings of the The Second International Conference on Availability, Reliability and Security, pages 908-916. IEEE Computer Society Press, 2007.
31. T. Y. C. Woo and S. S. Lam. A semantic model for authentication protocols. In Proc. 14th IEEE Symposium on Security & Privacy, pages 178-194. IEEE Computer Society Press, 1993.