Quantum protocols for anonymous voting and surveying

View/ Open
Author(s)
Vaccaro, JA
Spring, Joseph
Chefles, Anthony
Griffith University Author(s)
Year published
2007
Metadata
Show full item recordAbstract
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.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.
View less >
View less >
Journal Title
Physical Review A (Atomic, Molecular and Optical Physics)
Volume
75
Copyright Statement
© 2007 American Physical Society. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal link for access to the definitive, published version.
Subject
Mathematical sciences
Physical sciences
Chemical sciences