Functionality Description
(Quantum) E-voting allows the process of vote casting and counting with the help of quantum communication and quantum mechanical systems. This functionality comes with a guarantee that votes remain secret i.e. no one can link a voter to his vote, and comes with properties of verifiability and impossibility of double voting. Electronic voting protocols consist of election authorities, talliers, voters and bulletin boards. All quantum e-voting protocols are divided into three phases, setup phase, casting phase, and tally phase. In the Setup phase voting choices are defined and protocol parameters are generated.
In the casting phase votes are generated and cast and in the tally phase election result is computed.
Protocols
The protocols that implement this functionality are:
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Classical task.
- Classical Electronic voting.
Properties
- An e-voting protocol isย correctย if the outcome is correctly computed in honest rounds without the presence of an adversary.
- Vote privacyย means votersโ votes are private and there is no link between a voter and his vote.
- Impossibility of double votingย allows voters to vote at most once
- Verifiabilityย allows the verification of the results by voters and external auditors.
Further Information
No content has been added to this section, yet!
References
- Arapinis, Myrto, Elham Kashefi, Nikolaos Lamprou, and Anna Pappa. “Definitions and analysis of quantum e-voting protocols.”ย arXiv preprint arXiv:1810.05083ย (2018).


Leave a Reply