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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Toward quantum-ensured privacy and voting

Mark S. Hillery

Published Aug 31, 2006• 0 citations
Publisher

Abstract

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.
DOI
10.1117/12.675272

Related papers

Toward protocols for quantum-ensured privacy and secure voting

Marianna C. Bonanome, Vladimír Bužek, Mark S. Hillery +1 more

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.

arXiv:1108.5090•Physical Review A•Aug 24, 2011•53 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

Towards Quantum-based Election Scheme

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

The privacy of communicating participants is often of paramount importance, but in some situations it is an essential condition. A typical example is a fair (secret) voting. We analyze in detail communication privacy based on quantum resources, and we propose new quantum protocols. Possible generalizations that would lead to voting schemes are discussed.

•Jan 1, 2007•0 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

Privacy in a Quantum World

Charles H. Bennett, Peter W. Shor

Classical approaches to encoding information generally rely on using encryption protocols that are difficult for computers to crack, because the required mathematical operations are prohibitively slow on classical computers. However, the same encryption protocols will not work when quantum computers are developed, because these mathematical operations are much easier for them. Therefore, new protocols must be developed if information transfer is to be secure in a world where quantum computers are in use. [Bennett and Shor][1] discuss recent advances in this field, through which theory has caught up with experiment in quantum cryptography. [1]: http://www.sciencemag.org/cgi/content/short/284/5415/747

Science•Apr 30, 1999•18 citations

Quantum Anonymous Networking: A Quantum Leap in Privacy

Saw Nang Paing, Jason William Setiawan, Trung Q. Duong +3 more

Preserving privacy in communication and networking is of paramount importance in the Internet-of-Everything age of escalating surveillance and data collection. Anonymous communication is a cornerstone of this endeavor, enabling individuals to interact and exchange private information without disclosing their identities. However, achieving absolute security and privacy in classical anonymous networks (CANs) is highly challenging, and in particular, the advent of quantum computing poses critical threats to securing classical communication. In this article, we explore the evolution of CANs and delve into the distinctive shift from classical to quantum anonymous networks (QANs), emphasizing a substantial leap in privacy protected by quantum anonymous communication (QAC). The fundamental motivations behind this transition are rooted in the remarkable privacy attributes—e.g., completeanonymityanduntraceability— of QAC protocols, as well as the unconditional security ensured by the principles of quantum mechanics. To make these concepts more tangible in practical settings and provide a benchmark to design the QAC protocols in QANs, we usher in exemplary protocols: quantum anonymous teleportation, voting, and information retrieval. In these case studies, we assess the fidelity and error rates of the QAC protocols in noisy environments, aiming to evaluate their robustness in practical quantum entangled settings. Moreover, we discuss the primary challenges and future research directions integral to the transition towards QANs.

IEEE Network•Jun 3, 2024•10 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.
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.
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.
Classical approaches to encoding information generally rely on using encryption protocols that are difficult for computers to crack, because the required mathematical operations are prohibitively slow on classical computers. However, the same encryption protocols will not work when quantum computers are developed, because these mathematical operations are much easier for them. Therefore, new protocols must be developed if information transfer is to be secure in a world where quantum computers are in use. [Bennett and Shor][1] discuss recent advances in this field, through which theory has caught up with experiment in quantum cryptography. [1]: http://www.sciencemag.org/cgi/content/short/284/5415/747
Preserving privacy in communication and networking is of paramount importance in the Internet-of-Everything age of escalating surveillance and data collection. Anonymous communication is a cornerstone of this endeavor, enabling individuals to interact and exchange private information without disclosing their identities. However, achieving absolute security and privacy in classical anonymous networks (CANs) is highly challenging, and in particular, the advent of quantum computing poses critical threats to securing classical communication. In this article, we explore the evolution of CANs and delve into the distinctive shift from classical to quantum anonymous networks (QANs), emphasizing a substantial leap in privacy protected by quantum anonymous communication (QAC). The fundamental motivations behind this transition are rooted in the remarkable privacy attributes—e.g., completeanonymityanduntraceability— of QAC protocols, as well as the unconditional security ensured by the principles of quantum mechanics. To make these concepts more tangible in practical settings and provide a benchmark to design the QAC protocols in QANs, we usher in exemplary protocols: quantum anonymous teleportation, voting, and information retrieval. In these case studies, we assess the fidelity and error rates of the QAC protocols in noisy environments, aiming to evaluate their robustness in practical quantum entangled settings. Moreover, we discuss the primary challenges and future research directions integral to the transition towards QANs.