Anonymity and CSP for Voting Systems

In this paper we review a wide range of existing definitions for anonymity defined in different formal languages from the literature. Moreover, we discuss anonymity definitions for voting systems and model the specifications using Communicating Sequential Processes (CSP). In addition, we formalise conventional voting system with CSP and analyse whether our voting system design satisfies the anonymity requirement with two different definitions, strong and weak anonymity. Furthermore, we highlight the difference between strong and weak anonymity definitions regarding voting systems with a case study on conventional voting system. Finally, we conclude with the results taken from our model analysis, which expresses that the strong anonymity definition is too strong and the weak anonymity is more suitable specification for the voting processes.

[1]  Markus Jakobsson,et al.  Coercion-resistant electronic elections , 2005, WPES '05.

[2]  Mark Ryan,et al.  Coercion-resistance and receipt-freeness in electronic voting , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[3]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[4]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[5]  Andreas Pfitzmann,et al.  Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[6]  Martín Abadi,et al.  Hiding Names: Private Authentication in the Applied Pi Calculus , 2002, ISSS.

[7]  Vitaly Shmatikov,et al.  Information Hiding, Anonymity and Privacy: a Modular Approach , 2004, J. Comput. Secur..

[8]  Erik P. de Vink,et al.  A Formalization of Anonymity and Onion Routing , 2004, ESORICS.

[9]  Steve A. Schneider,et al.  CSP and Anonymity , 1996, ESORICS.

[10]  Michael Backes,et al.  Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[11]  Mark Ryan,et al.  Analysis of an Electronic Voting Protocol in the Applied Pi Calculus , 2005, ESOP.

[12]  Mark Ryan,et al.  Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster , 2010, Towards Trustworthy Elections.