Quantum election based on distributed scheme

We present an unconditionally secure quantum election scheme, which based on a distributed scheme to ensure the privacy of the voters. The voting administrator is made up by two parties who cannot cooperate within a certain period of time, and we use an”identity exchange”scheme to conceal the identity of voters. While the election is completed, nobody except the voter himself can match him with his ballot even if the administrator and the counter collaborate up to do so. The scheme can also work well with noisy and lossy quantum channels.

[1]  Hoi-Kwong Lo,et al.  Conference key agreement and quantum sharing of classical secrets with noisy GHZ states , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  L Yang,et al.  On the Breidbart eavesdropping problem of the extended BB84 QKD protocol , 2002 .

[3]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[4]  Fuguo Deng,et al.  Improving the security of multiparty quantum secret sharing against Trojan horse attack , 2005, quant-ph/0506194.

[5]  Mr. Sanjay Kumar,et al.  ANALYSIS OF ELECTRONIC VOTING SYSTEM IN VARIOUS COUNTRIES , 2011 .

[6]  H. Bechmann-Pasquinucci,et al.  Quantum cryptography , 2001, quant-ph/0101098.

[7]  V. Buzek,et al.  Towards quantum-based privacy and voting , 2005, quant-ph/0505041.

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

[9]  Shahar Dolev,et al.  A quantum secret ballot , 2006, ArXiv.

[10]  Matthias Christandl,et al.  Quantum Anonymous Transmissions , 2004, ASIACRYPT.

[11]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

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

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

[14]  Nasour Bagheri,et al.  A new secure and practical electronic voting protocol without revealing voters identity , 2011 .

[15]  D. Horoshko,et al.  Quantum anonymous voting with anonymity check , 2009, 0911.5605.

[16]  Marius Ion,et al.  An Electronic Voting System Based On The Blind Signature Protocol , 2011 .

[17]  Anthony Chefles,et al.  Quantum protocols for anonymous voting and surveying , 2005, quant-ph/0504161.

[18]  Arto Salomaa,et al.  Public-Key Cryptography , 1996, Texts in Theoretical Computer Science. An EATCS Series.

[19]  V. Buzek,et al.  Toward protocols for quantum-ensured privacy and secure voting , 2011, 1108.5090.

[20]  Wang Tian-yin,et al.  Fair quantum blind signatures , 2010 .

[21]  Stephen Wiesner,et al.  Conjugate coding , 1983, SIGA.

[22]  Lorrie Faith Cranor,et al.  Design and Implementation of a Practical Security-Conscious Electronic Polling System , 1996 .

[23]  V. Roychowdhury,et al.  Optimal encryption of quantum bits , 2000, quant-ph/0003059.

[24]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

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

[26]  Li Yang,et al.  Quantum election scheme based on anonymous quantum key distribution , 2012 .

[27]  Charles H. Bennett,et al.  Quantum cryptography using any two nonorthogonal states. , 1992, Physical review letters.

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

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

[30]  Guihua Zeng,et al.  Multi-object quantum traveling ballot scheme , 2009 .