Description
Voting protocols using entangled quantum states as ballots have been proposed as a solution to the problem of information-theoretically secure and private voting, something which is thus far unobtainable through classical schemes alone. However, quantum voting protocols are frequently impractically complex, resource-intensive and have poor robustness to noise, loss, or adversarial behaviour. In this work, we describe a trio of quantum voting protocols, presented in order of increasing security and complexity, each of which is underpinned by a simple Gaussian direct secure communications protocol which guarantees privacy by ensuring no information is leaked to other voters or external attackers.
We show that our most secure protocol substantially improves on the state of the art by being fully verifiable, resilient and private against up to N-2 colluding and malicious voters; moreover, we show that our scheme is distributively secure, i.e. secure not only against malicious voters but also against passive attackers who gain information from the channels over which the voting resource is transmitted.
| I am the presenting author | Yes |
|---|