Electronic Voting Schemes

Electronic voting is an application of cryptography. Voting schemes that provide receipt-freeness prevents voters from proving their cast vote, and hence thwart vote-buying and coercion. We revise the contemporary state of research in electronic voting and propose an efficient receipt-free voting scheme. Similar to the scheme of Hirt and Sako, it assumes the existence of untappable communication channels between the voter and the authorities. Compared to the receipt-free scheme of Hirt and Sako, the scheme described in this paper realizes an improvement of the total number of bits sent through the untappable channel by a factor L (number of possible votes/choices) while achieving the same security properties. We also discuss an implementation of the untappable channel.

[1]  Kazue Sako,et al.  Secure Voting Using Partially Compatible Homomorphisms , 1994, CRYPTO.

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

[3]  Chin-Laung Lei,et al.  Partially Blind Threshold signatures Based on Discrete Logarithm , 1999, Comput. Commun..

[4]  Ivan Damgård,et al.  Practical Threshold RSA Signatures without a Trusted Dealer , 2000, EUROCRYPT.

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

[6]  Ronald Cramer,et al.  A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..

[7]  Byoungcheon Lee,et al.  Receipt-free Electronic Voting through Collaboration of Voter and Honest Verifier , 2000 .

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

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

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

[11]  Michael J. Radwin.  An untraceable , universally verifiable voting scheme , 1997 .

[12]  Kaoru Kurosawa,et al.  Efficient Anonymous Channel and All/Nothing Election Scheme , 1994, EUROCRYPT.

[13]  Jacques Stern,et al.  Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.

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

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

[16]  Wen-Shenq Juang,et al.  A Veriiable Multi-authorities Secret Election Allowing Abstaining from Voting , 1998 .

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

[18]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

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

[20]  Colin Boyd,et al.  A New Multiple Key Cipher and an Improved Voting Scheme , 1990, EUROCRYPT.

[21]  Chin-Laung Lei,et al.  A Secure and Practical Electronic Voting Scheme for Real World Environments , 1997 .

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