46
edits
(Created page with "This example protocol implements the task of |Quantum E-voting. The protocol uses an entangled state with a special property as a blank ballot an...") |
No edit summary |
||
Line 1: | Line 1: | ||
This example protocol implements the task of [[Quantum Electronic Voting | This example protocol implements the task of [[Quantum Electronic Voting| Quantum E-voting]]. The protocol uses an entangled state with a special property as a blank ballot and is self-tallying i.e. The voters, without the presence of any trusted authority or tallier, need to verify that they share specific quantum states.<br/><br/> | ||
==Assumptions== | ==Assumptions== | ||
Line 19: | Line 19: | ||
* <math>P_{N}</math>: set of all possible permutations with N elements | * <math>P_{N}</math>: set of all possible permutations with N elements | ||
* <math>B_{k}: k^{th}</math> voter’s blank ballot | * <math>B_{k}: k^{th}</math> voter’s blank ballot | ||
==Properties== | |||
* This protocol is not secure. (doesn’t satisfy quantum privacy property.) | |||
We can construct an adversary that violates privacy by an attack on the cut and choose technique of the protocol with a non-negligible advantage in <math>\delta_{0}</math>. | |||
== Requirements == | |||
* Quantum memory for each party to store qubits | |||
* Measurement Devices for each party | |||
* Quantum channel capable of sending qubits | |||
* Classical channel to send multiple bits | |||
==Protocol Description== | |||
==Further Information== | |||
<div style='text-align: right;'>''*contributed by Sara Sarfaraz''</div> |