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

NTT technical review

Quantum Voting Scheme Based on Conjugate Coding

Tatsuaki Okamoto, Koutarou Suzuki, Yuuki Tokunaga

Published Jan 1, 2008• 8 citations
Publisher

Abstract

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.

DOI
10.53829/ntr200801sp3

Related papers

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 election based on distributed scheme

Rui-Rui Zhou, Li Yang

We present an unconditionally secure quantum election scheme, which based on a distributed scheme to ensure the privacy of the voters. The voting administrator is made up by two parties who cannot cooperate within a certain period of time, and we use an”identity exchange”scheme to conceal the identity of voters. While the election is completed, nobody except the voter himself can match him with his ballot even if the administrator and the counter collaborate up to do so. The scheme can also work well with noisy and lossy quantum channels.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 29, 2012•0 citations

Distributed quantum election scheme

Rui-Rui Zhou, Li Yang

In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum election scheme with a voting administrator made up of more than one part. This quantum election scheme can resist the malicious acts of the voting administrator and the counter after the election and can work in a system with lossy and noisy quantum channels.

arXiv:1304.0555•Apr 2, 2013•2 citations

A quantum secret ballot

Shahar Dolev, Itamar Pitowsky, Boaz Tamir

The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity of the voter, explicitly marked on the "envelope" containing it. Measuring the content of the envelope yields a random number which reveals no information about the vote. However, the outcome of the elections can be unambiguously decided after adding the random numbers from all envelopes. We consider a few versions of the protocol and their complexity of implementation.

arXiv:quant-ph/0602087•Feb 9, 2006•10 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

Quantum protocols for anonymous voting and surveying

Joan A. Vaccaro, Joseph Spring, Anthony Chefles

We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a $N$-fold reduction in computational complexity, where $N$ is the number of voters.

arXiv:quant-ph/0504161•Physical Review A•Jan 26, 2007•177 citations
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.
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 present an unconditionally secure quantum election scheme, which based on a distributed scheme to ensure the privacy of the voters. The voting administrator is made up by two parties who cannot cooperate within a certain period of time, and we use an”identity exchange”scheme to conceal the identity of voters. While the election is completed, nobody except the voter himself can match him with his ballot even if the administrator and the counter collaborate up to do so. The scheme can also work well with noisy and lossy quantum channels.
In an electronic voting protocol, a distributed scheme can be used for forbidding the malicious acts of the voting administrator and the counter during the election, but it cannot prevent them from collaborating to trace the ballots and destroy their privacy after the election. We present a distributed anonymous quantum key distribution scheme and further construct a distributed quantum election scheme with a voting administrator made up of more than one part. This quantum election scheme can resist the malicious acts of the voting administrator and the counter after the election and can work in a system with lossy and noisy quantum channels.
The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity of the voter, explicitly marked on the "envelope" containing it. Measuring the content of the envelope yields a random number which reveals no information about the vote. However, the outcome of the elections can be unambiguously decided after adding the random numbers from all envelopes. We consider a few versions of the protocol and their complexity of implementation.
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.
We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated sites; the physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The security of these protocols with respect to various kinds of attack is discussed. We also discuss classical schemes and show that our quantum voting protocol represents a NNN-fold reduction in computational complexity, where NNN is the number of voters.