A Secure Quantum Protocol for Anonymous One-Vote Veto Voting
Voting is one of the most prominent components of democracy. The one-vote veto, which requires the voting result to be only “yes” or “no”, is a particularly noteworthy type of voting with widespread application. When obtaining a “no”...
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
IEEE
2021
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/4afd53751d944ddfa3e3a24f4c94bff0 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| Résumé: | Voting is one of the most prominent components of democracy. The one-vote veto, which requires the voting result to be only “yes” or “no”, is a particularly noteworthy type of voting with widespread application. When obtaining a “no” result, no useful information about the number of “no” votes and who votes “no” is disclosed. In this paper, we introduce a protocol for anonymous one-vote veto utilizing qubits and local Pauli operations <inline-formula> <tex-math notation="LaTeX">$\mathbb {Z}$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$\mathbb {X}$ </tex-math></inline-formula>, building simple processes for easy implementation under the current technology. For better elaboration, we give two examples: all voters cast “yes” votes and only one voter casts a “no.” Then, the corresponding experiment tests are conducted on the simulated IBM quantum computer to verify their feasibility. We also show that the proposed protocol has the desirable properties of privacy, fairness, verifiability and robustness. Furthermore, we analyze the proposed protocol’s security against cheating from eavesdroppers, a semi-honest server and malicious voters. This work is the first attempt to illustrate how qubits can be useful for building a secure anonymous one-vote veto strategy. |
|---|