A quantum secret ballot
| dc.creator | Dolev, Shahar | |
| dc.creator | Pitowsky, Itamar | |
| dc.creator | Tamir, Boaz | |
| dc.date | 2006-02-09 | |
| dc.date | 2006-03-18 | |
| dc.date.accessioned | 2026-07-07T07:04:16Z | |
| dc.date.available | 2026-07-07T07:04:16Z | |
| dc.description | The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity of the voter, explicitly marked on the "envelope" containing it. Measuring the content of the envelope yields a random number which reveals no information about the vote. However, the outcome of the elections can be unambiguously decided after adding the random numbers from all envelopes. We consider a few versions of the protocol and their complexity of implementation. | |
| dc.description | RevReX, 7 pages, minor revisions, small additions | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0602087 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0602087 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/109302 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | A quantum secret ballot | |
| dc.type | text |