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

Chinese Optics Letters

Multi-object quantum traveling ballot scheme

李渊 Yuan Li, 曾贵华. Guihua Zeng

Published Jan 1, 2009• 3 citations
Publisher

Abstract

Based on quantum mechanics, a traveling ballot scheme with anonymity and secrecy is introduced to realize voting.By searching the objects in large amount of data bases, every voter may cast votes to his desired candidates.Therefore, the proposed scheme may be applied to voting with a great deal of candidates, such as network voting and so on.The security analysis of the present scheme is also performed.

DOI
10.3788/col20090702.0152

Related papers

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

Novel traveling quantum anonymous voting scheme via GHZ states

Wenhao Zhao, Min Jiang

Based on traveling ballot mode, we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger (GHZ) states. In this scheme, each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content. The voters have multiple ballot items to choose rather than just binary options “yes” or “no”. After counting votes phase, any participant who is interested in voting results can obtain the voting results. To improve the efficiency of the traveling quantum anonymous voting scheme, an optimization method based on grouping strategy is also presented. Compared with the most existing traveling quantum voting schemes, the proposed scheme is more practical because of its privacy, verifiability and non-repeatability. Furthermore, the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

Chinese Physics B•Oct 19, 2022•3 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

Quantum Voting Scheme Based on Conjugate Coding

Tatsuaki Okamoto, Koutarou Suzuki, Yuuki Tokunaga

We describe a quantum voting scheme in which a ballot is an unknown quantum state for a voter.Such a ballot is hard to forge because it is difficult in principle to make a copy of an unknown quantum state.Moreover, our quantum voting scheme guarantees anonymity because the ballot can be randomized by voters.We also describe a distributed variant of our scheme that is robust against a dishonest administrator.This scheme should remain usable in the coming era of quantum computers, which are expected to break most existing cryptographic schemes.

NTT technical review•Jan 1, 2008•8 citations

Quantum anonymous voting for continuous variables

Lang Jiang, Guangqiang He, Ding Nie +2 more

A series of quantum voting protocols of continuous variables is proposed. Three methods are employed to ensure that the quantum voting obeys some desirable rules. Entanglement is used to keep voters away from the voting results. We enable voters to operate identically to represent the same vote to prevent the tallyman from gaining information about individual voters. We also propose an effective scheme to prevent voters from voting more than once. In both two-valued and multivalued ballot protocols, several specific constraints are set to meet the rules.

Physical Review A•Apr 9, 2012•70 citations

Anonymous voting for multi-dimensional CV quantum system

Ronghua Shi, Yi Xiao, Jinjing Shi +2 more

We investigate the design of anonymous voting protocols, CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables (CV) in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy. The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission, which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states. It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security, especially in large-scale votes.

Chinese Physics B•Jun 1, 2016•3 citations
Based on quantum mechanics, a traveling ballot scheme with anonymity and secrecy is introduced to realize voting.By searching the objects in large amount of data bases, every voter may cast votes to his desired candidates.Therefore, the proposed scheme may be applied to voting with a great deal of candidates, such as network voting and so on.The security analysis of the present scheme is also performed.
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.
Based on traveling ballot mode, we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger (GHZ) states. In this scheme, each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content. The voters have multiple ballot items to choose rather than just binary options “yes” or “no”. After counting votes phase, any participant who is interested in voting results can obtain the voting results. To improve the efficiency of the traveling quantum anonymous voting scheme, an optimization method based on grouping strategy is also presented. Compared with the most existing traveling quantum voting schemes, the proposed scheme is more practical because of its privacy, verifiability and non-repeatability. Furthermore, the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.
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.
We describe a quantum voting scheme in which a ballot is an unknown quantum state for a voter.Such a ballot is hard to forge because it is difficult in principle to make a copy of an unknown quantum state.Moreover, our quantum voting scheme guarantees anonymity because the ballot can be randomized by voters.We also describe a distributed variant of our scheme that is robust against a dishonest administrator.This scheme should remain usable in the coming era of quantum computers, which are expected to break most existing cryptographic schemes.
A series of quantum voting protocols of continuous variables is proposed. Three methods are employed to ensure that the quantum voting obeys some desirable rules. Entanglement is used to keep voters away from the voting results. We enable voters to operate identically to represent the same vote to prevent the tallyman from gaining information about individual voters. We also propose an effective scheme to prevent voters from voting more than once. In both two-valued and multivalued ballot protocols, several specific constraints are set to meet the rules.
We investigate the design of anonymous voting protocols, CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables (CV) in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy. The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission, which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states. It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security, especially in large-scale votes.