corner
corner

Phys. Rev. A 75, 012333 (2007) [8 pages]

Quantum protocols for anonymous voting and surveying

Download: PDF (110 kB) Buy this article Export: BibTeX or EndNote (RIS)

J. A. Vaccaro1,2, Joseph Spring3, and Anthony Chefles4
1Centre for Quantum Computer Technology, Centre for Quantum Dynamics, School of Science, Griffith University, Brisbane 4111, Australia
2Quantum Physics Group, STRI, University of Hertfordshire, College Lane, Hatfield, AL10 9AB, United Kingdom
3Quantum Information Group, School of Computer Science, University of Hertfordshire, Hatfield, AL10 9AB, Hertfordshire, United Kingdom
4Quantum Information Processing Group, Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS34 8QZ, United Kingdom

Received 21 April 2005; revised 8 November 2006; published 26 January 2007

We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a N-fold reduction in computational complexity, where N is the number of voters.

© 2007 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevA.75.012333
DOI:
10.1103/PhysRevA.75.012333
PACS:
03.67.Dd, 03.65.Ud, 03.65.Vf