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

arXiv:1108.5090 · Physical Review A

Toward protocols for quantum-ensured privacy and secure voting

Marianna C. Bonanome, Vladimír Bužek, Mark S. Hillery, Mário Ziman

Published Aug 24, 2011• 53 citations
arXivHTMLPDF

Abstract

We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see M. Hillery, M. Ziman, V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and M. Bielikov\'a, Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multiparty function evaluation. We consider functions corresponding to group multiplication of $N$ group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.

DOI
10.1103/physreva.84.022331

Related papers

Toward quantum-ensured privacy and voting

Mark S. Hillery

A number of schemes that use quantum mechanics to preserve privacy are presented. In particular, anonymous broadcast channels, voting, and secure function evaluation are discussed. It is found that entangled quantum states can be useful in maintaining privacy.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 31, 2006•0 citations

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

A Comprehensive Analysis of Quantum E-voting Protocols

Myrto Arapinis, Elham Kashefi, Nikolaos Lamprou +1 more

Recent advances at Google, IBM, as well as a number of research groups indicate that quantum computers will soon be reality. Motivated by the ever more realistic threat quantum computers pose to existing classical cryptographic protocols, researchers have developed several schemes to resist "quantum attacks". In particular, for electronic voting, several e-voting schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims which are never formalized and are at best justified only against specific attacks. In this paper, we systematize and evaluate the security of suggested e-voting protocols based on quantum technology. We examine the claims of these works concerning privacy, correctness and verifiability, and if they are correctly attributed to the proposed protocols. In all non-trivial cases, we identified specific quantum attacks that violate these properties. We argue that the cause of these failures lies in the absence of formal security models and in a more general lack of reference to the existing cryptographic literature.

•Aug 27, 2018•2 citations

Definitions and Security of Quantum Electronic Voting

Myrto Arapinis, Nikolaos Lamprou, Elham Kashefi +1 more

Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have developed several schemes to resist “quantum attacks.” In particular, for electronic voting (e-voting), several schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims that are never formalized and are at best justified only against specific attacks. To address this, we propose the first formal security definitions for quantum e-voting protocols. With these at hand, we systematize and evaluate the security of previously proposed quantum e-voting protocols; we examine the claims of these works concerning privacy, correctness, and verifiability, and if they are correctly attributed to the proposed protocols. In all non-trivial cases, we identify specific quantum attacks that violate these properties. We argue that the cause of these failures lies in the absence of formal security models and references to the existing cryptographic literature.

arXiv:1810.05083•ACM Transactions on Quantum Computing•Mar 31, 2021•21 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

Quantum Cryptography and its Implications for Secure Voting Systems

Shweta Bandhekar

Ensuring the security and integrity of voting systems is crucial for maintaining democratic processes. With the rise of cyber threats targeting electronic voting, traditional cryptographic methods are proving inadequate in safeguarding against sophisticated attacks. Quantum cryptography, particularly Quantum Key Distribution (QKD), offers a promising solution to enhance the security of voting systems by leveraging the principles of quantum mechanics. This research explores the application of quantum cryptography in secure voting, highlighting its potential to address vulnerabilities in current systems. The study examines the technological, practical, and legal challenges of implementing quantum-based voting systems, including infrastructure requirements and public acceptance. Furthermore, it assesses how quantum cryptography ensures voter privacy, prevents tampering, and provides robust protection against future quantum computing threats. While significant hurdles remain, the integration of quantum cryptographic techniques presents a transformative opportunity to create more secure and transparent voting processes. This paper outlines the roadmap for adopting quantum cryptography in voting systems and its potential impact on electoral integrity.

Computer Fraud & Security•Dec 1, 2024•0 citations
We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see M. Hillery, M. Ziman, V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and M. Bielikov'a, Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multiparty function evaluation. We consider functions corresponding to group multiplication of NNN group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.
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.
Recent advances at Google, IBM, as well as a number of research groups indicate that quantum computers will soon be reality. Motivated by the ever more realistic threat quantum computers pose to existing classical cryptographic protocols, researchers have developed several schemes to resist "quantum attacks". In particular, for electronic voting, several e-voting schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims which are never formalized and are at best justified only against specific attacks. In this paper, we systematize and evaluate the security of suggested e-voting protocols based on quantum technology. We examine the claims of these works concerning privacy, correctness and verifiability, and if they are correctly attributed to the proposed protocols. In all non-trivial cases, we identified specific quantum attacks that violate these properties. We argue that the cause of these failures lies in the absence of formal security models and in a more general lack of reference to the existing cryptographic literature.
Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have developed several schemes to resist “quantum attacks.” In particular, for electronic voting (e-voting), several schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims that are never formalized and are at best justified only against specific attacks. To address this, we propose the first formal security definitions for quantum e-voting protocols. With these at hand, we systematize and evaluate the security of previously proposed quantum e-voting protocols; we examine the claims of these works concerning privacy, correctness, and verifiability, and if they are correctly attributed to the proposed protocols. In all non-trivial cases, we identify specific quantum attacks that violate these properties. We argue that the cause of these failures lies in the absence of formal security models and references to the existing cryptographic literature.
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.
Ensuring the security and integrity of voting systems is crucial for maintaining democratic processes. With the rise of cyber threats targeting electronic voting, traditional cryptographic methods are proving inadequate in safeguarding against sophisticated attacks. Quantum cryptography, particularly Quantum Key Distribution (QKD), offers a promising solution to enhance the security of voting systems by leveraging the principles of quantum mechanics. This research explores the application of quantum cryptography in secure voting, highlighting its potential to address vulnerabilities in current systems. The study examines the technological, practical, and legal challenges of implementing quantum-based voting systems, including infrastructure requirements and public acceptance. Furthermore, it assesses how quantum cryptography ensures voter privacy, prevents tampering, and provides robust protection against future quantum computing threats. While significant hurdles remain, the integration of quantum cryptographic techniques presents a transformative opportunity to create more secure and transparent voting processes. This paper outlines the roadmap for adopting quantum cryptography in voting systems and its potential impact on electoral integrity.