A Receipt-free Multi-Authority E-Voting System

existing e-voting schemes satisfied requirements such as eligibility, completeness, "no vote duplication", privacy but have not been able to solve the problems of universal verifiability, coercion, bribery and fairness in the overall election process. In this work, a receipt-free multi-authority e-voting system is proposed to solve the drawbacks of the existing e-voting systems is proposed. The proposed scheme employs ElGamal encryption for ensuring the security of votes because of its probabilistic nature. ElGamal which is homomorphic with multiplication is modified to be additive homomorphic in order to ensure voters" privacy and overall election efficiency. A trusted centre is involved in the scheme to distribute the shared secret key among the authorities and the Shamir(t, n) threshold scheme is used for key distribution. The authorities will then use this share secret to decrypt the encrypted ballot. 1-out-of-L re- encryption is used to guarantee receipt-freeness. The proposed scheme is divided into registration, validation, vote casting and tallying phases. The security analysis of the scheme was then carried out to show its effectiveness.

[1]  Lina Wang,et al.  A More Effective Voting Scheme based on Blind Signature , 2006, 2006 International Conference on Computational Intelligence and Security.

[2]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

[3]  Horng-Twu Liaw,et al.  A secure electronic voting protocol for general elections , 2004, Comput. Secur..

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

[5]  Josh Benaloh,et al.  Receipt-Free Secret-Ballot Elections , 1994, STOC 1994.

[6]  Zuzana Rjašková.  Electronic Voting Schemes , 2002 .

[7]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[8]  Kazue Sako.  Electronic Voting Schemes , 2005, Encyclopedia of Cryptography and Security.

[9]  Emmanouil Magkos,et al.  Receipt-Freeness in Large-Scale Elections without Untappable Channels , 2001, I3E.

[10]  Josh Benaloh.  Verifiable secret-ballot elections , 1987 .

[11]  Hugo Krawczyk,et al.  Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , 1999, Journal of Cryptology.

[12]  Michael J. Fischer,et al.  A robust and verifiable cryptographically secure election scheme , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Jacques Stern,et al.  Practical multi-candidate election system , 2001, PODC '01.

[14]  Ronald Cramer,et al.  A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 ) , 2000 .

[15]  Chin-Laung Lei,et al.  A Verifiable Multi-Authority Secret Election Allowing Abstention from Voting , 2002, Comput. J..

[16]  Michael R. Clarkson,et al.  Civitas: Toward a Secure Voting System , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[17]  Emmanouil Magkos,et al.  Towards Secure and Practical E-Elections in the New Era , 2003, Secure Electronic Voting.

[18]  Kazue Sako,et al.  Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth , 1995, EUROCRYPT.

[19]  Moni Naor,et al.  Receipt-Free Universally-Verifiable Voting with Everlasting Privacy , 2006, CRYPTO.

[20]  Geir Røsland,et al.  Remote Electronic Voting , 2004 .

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

[22]  Markus Jakobsson,et al.  Flash mixing , 1999, PODC '99.

[23]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[24]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[25]  Josef Pieprzyk,et al.  A Practical Electronic Voting Protocol Using Threshold Schemes , 2008 .

[26]  Wei-Chi Ku,et al.  An e-Voting Scheme with Improved Resistance to Bribe and Coercion , 2004, IACR Cryptol. ePrint Arch..

[27]  Chinniah Porkodi,et al.  Multi-authority Electronic Voting Scheme Based on Elliptic Curves , 2011, Int. J. Netw. Secur..

[28]  Kazue Sako,et al.  Efficient Receipt-Free Voting Based on Homomorphic Encryption , 2000, EUROCRYPT.

[29]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[30]  Josh Benaloh,et al.  Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.

[31]  Subariah Ibrahim,et al.  Secure E-voting with blind signature , 2003, 4th National Conference of Telecommunication Technology, 2003. NCTT 2003 Proceedings..

[32]  Tatsuaki Okamoto,et al.  Receipt-Free Electronic Voting Schemes for Large Scale Elections , 1997, Security Protocols Workshop.

[33]  Patrick Horster,et al.  Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme , 1996, ASIACRYPT.

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

[35]  Kefei Chen,et al.  Receipt-Freeness for Groth e-Voting Schemes , 2009, J. Inf. Sci. Eng..

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

[37]  Valtteri Niemi,et al.  How to Prevent Buying of Votes in Computer Elections , 1994, ASIACRYPT.