Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IET Quantum Communication

Quantum anonymous one vote veto protocol based on entanglement swapping

Y. H. Wang, Min Jiang, Yuzhen Wei, Wenhao Zhao

Published Dec 1, 2024• 1 citation
Publisher

Abstract

Abstract As a special voting method, one‐vote veto voting also has a wide range of applications. A veto means that when the voting council puts forward a proposal, it cannot pass unless all the voters agree to it. If there is a no vote, the proposal will be rejected, but no one will know how anyone else votes. In most existing quantum anonymous one‐vote veto voting protocols, an absolutely honest third party is generally required to assist the voting. However, it is difficult to find a fully trusted third party in reality. In addition, the existing quantum anonymous one‐vote veto protocol does not consider the attack from the insider voters. Therefore, based on the characteristics of entanglement swapping between the Cat state and Bell state, the authors propose a new quantum anonymous one‐vote veto protocol, which can not only calculate the voting result quickly and effectively but also demonstrate higher security.

DOI
10.1049/qtc2.12117

Related papers

Self-tallying quantum anonymous voting

Qingle Wang, Chao‐Hua Yu, Fei Gao +2 more

Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.

arXiv:1605.07942•Physical Review A•Aug 24, 2016•81 citations

Decentralized quantum anonymous veto voting scheme based on measurement-device-independence

Xiaotong Xu, Runhua Shi, Weiyang Ke

Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.

Physica Scripta•Aug 14, 2023•6 citations

A Secure Quantum Protocol for Anonymous One-Vote Veto Voting

Songyang Wu, Wenqi Sun, Qingle Wang +4 more

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 Z and X, 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.

IEEE Access•Jan 1, 2021•6 citations

Quantum Distributed Ballot Scheme Based on Entanglement Swapping

Xiaoping Lou, Zhigang Chen

We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Nov 1, 2011•1 citation

A self-tallying quantum anonymous voting protocol for multiple-selection elections

Guang-Bao Xu, Meng-Na Li, Yu-Guang Yang +1 more

Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with multi-selection voting functionality. In our protocol, $nm$ $n$-particle entangled states are equally divided into $n$ groups, and the $n$ particles in each entangled state are delivered to $n$ voters, one particle per voter. Each voter obtains $n$ voting vectors by sequentially measuring all his (or her) particles that belong to $n$ different group, and then encodes his or her voting information into the vector corresponding to the secret index. Due to entanglement correlation, each voter can verify whether his or her ballot is correct through computation, while any participant can obtain the vote count for each candidate through computation. Our protocol satisfies self-tallying, nonreusability, verifiability, and fairness.

quant-pharXiv:2609.39835•Oct 1, 2026•0 citations

Quantum anonymous voting protocol based on single-particle

Jiang-Shan Liu, Yuancheng Li, Qing-Le Wang +2 more

Abstract Anonymous voting is often one decision-making choice in many democracies. Facing the security threats from quantum computers, classical anonymous voting protocols based on computational complexity hypothesis have innovated to quantum anonymous voting protocols based on quantum mechanics. In this paper, we propose a quantum anonymous voting protocol by using high-dimension single particles. With the help of EA and T , the construction of our protocol makes each legitimate voter cast only one ballot, and all ballots open in a quite random rearrangement. Each voter can anonymously trace his/her vote by a private position index, thus our protocol achieving the precious properties of eligibility, privacy, no-reusability, verifiability and fairness. We also analyze that the protocol can successfully resist attacks from external eavesdroppers and internal participants, ensuring that our voting protocol is secure under ideal conditions. Designing mature quantum anonymous voting protocols is challenging.

Physica Scripta•Mar 26, 2021•8 citations
Abstract As a special voting method, one‐vote veto voting also has a wide range of applications. A veto means that when the voting council puts forward a proposal, it cannot pass unless all the voters agree to it. If there is a no vote, the proposal will be rejected, but no one will know how anyone else votes. In most existing quantum anonymous one‐vote veto voting protocols, an absolutely honest third party is generally required to assist the voting. However, it is difficult to find a fully trusted third party in reality. In addition, the existing quantum anonymous one‐vote veto protocol does not consider the attack from the insider voters. Therefore, based on the characteristics of entanglement swapping between the Cat state and Bell state, the authors propose a new quantum anonymous one‐vote veto protocol, which can not only calculate the voting result quickly and effectively but also demonstrate higher security.
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.
Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.
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 Z and X, 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.
We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.
Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with multi-selection voting functionality. In our protocol, nmnmnm nnn-particle entangled states are equally divided into nnn groups, and the nnn particles in each entangled state are delivered to nnn voters, one particle per voter. Each voter obtains nnn voting vectors by sequentially measuring all his (or her) particles that belong to nnn different group, and then encodes his or her voting information into the vector corresponding to the secret index. Due to entanglement correlation, each voter can verify whether his or her ballot is correct through computation, while any participant can obtain the vote count for each candidate through computation. Our protocol satisfies self-tallying, nonreusability, verifiability, and fairness.
Abstract Anonymous voting is often one decision-making choice in many democracies. Facing the security threats from quantum computers, classical anonymous voting protocols based on computational complexity hypothesis have innovated to quantum anonymous voting protocols based on quantum mechanics. In this paper, we propose a quantum anonymous voting protocol by using high-dimension single particles. With the help of EA and T , the construction of our protocol makes each legitimate voter cast only one ballot, and all ballots open in a quite random rearrangement. Each voter can anonymously trace his/her vote by a private position index, thus our protocol achieving the precious properties of eligibility, privacy, no-reusability, verifiability and fairness. We also analyze that the protocol can successfully resist attacks from external eavesdroppers and internal participants, ensuring that our voting protocol is secure under ideal conditions. Designing mature quantum anonymous voting protocols is challenging.