Quantum voting based on conjugate coding: Difference between revisions

Jump to navigation Jump to search
(Created page with "This example protocol implements the task of E-voting. The participants in this family of protocols are one or more election authorities, the tallier, and the voters. The elec...")
 
Line 22: Line 22:


==Properties==
==Properties==
'''Verifiability''': An adversary can change the vote of an eligible voter when the corresponding ballot is cast over the anonymous channel.
* '''Verifiability''': An adversary can change the vote of an eligible voter when the corresponding ballot is cast over the anonymous channel.
'''Privacy''': EA can introduce a “serial number” in a blank ballot to identify a voter and therefore violate privacy.
* '''Privacy''': EA can introduce a “serial number” in a blank ballot to identify a voter and therefore violate privacy.
The security of the protocol relies on a quantum problem, named one-more-unforgeability, and the assumption that it is computationally hard for a quantum adversary.
The security of the protocol relies on a quantum problem, named one-more-unforgeability, and the assumption that it is computationally hard for a quantum adversary.


== Requirements ==
== Requirements ==

Navigation menu