Editing Quantum voting based on conjugate coding

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
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 ==
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Quantum Protocol Zoo:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel Editing help (opens in new window)