Quantum protocols for anonymous voting and surveying

J.  Vaccaro; Joseph Spring; Anthony Chefles

doi:10.1103/PhysRevA.75.012333

Quantum protocols for anonymous voting and surveying

J. Vaccaro, Joseph Spring, Anthony Chefles

Research output: Contribution to journal › Article › peer-review

89 Citations (Scopus)

60 Downloads (Pure)

Abstract

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.

Original language	English
Article number	012333
Number of pages	8
Journal	Physical Review A
Volume	75
Issue number	1
DOIs	https://doi.org/10.1103/PhysRevA.75.012333
Publication status	Published - Jan 2007

Access to Document

10.1103/PhysRevA.75.012333Licence: Other

906514Accepted author manuscript, 191 KB
PhysRevA.75.012333
©2007 American Physical Society.
Final published version, 111 KBLicence: Other

Cite this

@article{f297376d9f4f4da4a3d5c4b6ef37874e,

title = "Quantum protocols for anonymous voting and surveying",

abstract = "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.",

author = "J. Vaccaro and Joseph Spring and Anthony Chefles",

year = "2007",

month = jan,

doi = "10.1103/PhysRevA.75.012333",

language = "English",

volume = "75",

journal = "Physical Review A",

issn = "1094-1622",

publisher = "American Physical Society (APS)",

number = "1",

}

TY - JOUR

T1 - Quantum protocols for anonymous voting and surveying

AU - Vaccaro, J.

AU - Spring, Joseph

AU - Chefles, Anthony

PY - 2007/1

Y1 - 2007/1

N2 - 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.

AB - 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.

U2 - 10.1103/PhysRevA.75.012333

DO - 10.1103/PhysRevA.75.012333

M3 - Article

SN - 1094-1622

VL - 75

JO - Physical Review A

JF - Physical Review A

IS - 1

M1 - 012333

ER -

Quantum protocols for anonymous voting and surveying

Abstract

Access to Document

Fingerprint

Cite this