MVP: An Efficient Anonymous E-Voting Protocol

Thanks to the Internet, voters can cast their ballots over the electronic voting (E-voting) systems conveniently and efficiently without going to the polling stations. However, existing E- voting protocols suffer from anonymity issues and/or high deployment overhead. In this paper, we design a practical anonymous E-voting protocol (referred to as MVP) based on a novel data collection technique called \emph{dual random matrix masking} (DRMM), which guarantees anonymity with low overhead of computation, and achieves the security goals of receipt-freeness, double voting detection, fairness, ballot secrecy, and integrity. Through extensive analyses on correctness, efficiency, and security properties, we demonstrate our proposed MVP protocol can be applied to E-voting in a variety of situations with accuracy and anonymity.

[1]  Byoungcheon Lee,et al.  Multiplicative Homomorphic E-Voting , 2004, INDOCRYPT.

[2]  Markus Jakobsson,et al.  Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking , 2002, USENIX Security Symposium.

[3]  C. Andrew Neff,et al.  A verifiable secret shuffle and its application to e-voting , 2001, CCS '01.

[4]  Rathindra Sarathy,et al.  Data Shuffling - A New Masking Approach for Numerical Data , 2006, Manag. Sci..

[5]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[6]  David Chaum,et al.  Secret-ballot receipts: True voter-verifiable elections , 2004, IEEE Security & Privacy Magazine.

[7]  Joseph K. Liu,et al.  Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups (Extended Abstract) , 2004, ACISP.

[8]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[9]  Hoeteck Wee,et al.  Toward Privacy in Public Databases , 2005, TCC.

[10]  George T. Duncan,et al.  Enhancing Access to Microdata while Protecting Confidentiality: Prospects for the Future , 1991 .

[11]  Ben Adida,et al.  Helios: Web-based Open-Audit Voting , 2008, USENIX Security Symposium.

[12]  Jeremy Clark,et al.  Scantegrity: End-to-End Voter-Verifiable Optical- Scan Voting , 2008, IEEE Security & Privacy.

[13]  Joseph K. Liu,et al.  Robust Receipt-Free Election System with Ballot Secrecy and Verifiability , 2008, NDSS.

[14]  David Chaum,et al.  Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA , 1988, EUROCRYPT.

[15]  Joan Borrell,et al.  Practical Approach to Anonymity in Large Scale Electronic Voting Schemes , 1999, NDSS.

[16]  Stephen E. Fienberg,et al.  Random orthogonal matrix masking methodology for microdata release , 2008, Int. J. Inf. Comput. Secur..

[17]  A. S. Sodiya,et al.  A Receipt-free Multi-Authority E-Voting System , 2011 .