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:2411.04503 · Lecture notes in computer science

On Voting Process and Quantum Mechanics

François Dubois

Published Jan 1, 2009• 5 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-00834-4_17

Related papers

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

An Improved Quantum Voting Scheme

Xu-Feng Niu, Jian-Zhong Zhang, Shu-Cui Xie +1 more

International Journal of Theoretical Physics•Jul 27, 2018•10 citations

On Quantum Mechanics

G. Feild

•Oct 15, 2018•0 citations

Quantum voting protocol from classical assumptions

Tingyu Ge, Mingqiang Wang, Xiaolei Wang +2 more

Abstract Quantum voting allows us to design voting scheme by quantum mechanics. The existing quantum voting protocols (QVPs) mainly use quantum entangled states. However, the existing protocols consider the problem of repeated voting and tampered voting by malicious voters, and hybrid QVPs have not been discussed. In this paper, we use EFI pairs (Entity-Friendly Integer pairs) instead of quantum entangled states to address the shortage of existing protocols, and propose a new QVP. Our protocol is structured to avoid repeated voting by any voter, and can prevent the leakage of voters’ voting information. The security of our protocol can be finally reduced to a classical assumption i.e. BQP = QMA. In addition, compared with the existing results, our protocol has fewer interaction rounds. Combined with post-quantum key distribution, we further optimize the protocol to prevent malicious adversaries from interfering with the final voting results. Moreover, we use extended noisy trapdoor claw-free function (ENTCF) to construct the first hybrid QVP, which allows a classical voter to interact with a quantum center through a classical channel to complete the voting process.

Journal of Physics Communications•Sep 18, 2026•0 citations

On the nature of quantum mechanics

Alexander H Klotz

Synthese•Nov 1, 1988•4 citations

Designing a Robust Quantum Signature Protocol Based on Quantum Key Distribution for E-Voting Applications

Sunil Prajapat, Urmika Gautam, Deepika Gautam +2 more

The rapid advancement of internet technology has raised attention to the importance of electronic voting in maintaining democracy and fairness in elections. E-voting refers to the use of electronic technology to facilitate the casting and counting of votes in elections. The need for designated verification arises from concerns about voter privacy, auditability, and the prevention of manipulation. Traditional e-voting systems use cryptographic techniques for security but lack verifiable proof of integrity. Integrating e-voting with a quantum designated verifier could address these challenges by leveraging the principles of quantum mechanics to enhance security and trustworthiness. In light of this, we propose a quantum e-voting scheme that uses a designated verifier signature. To ensure the confidentiality and authenticity of the voting process, the scheme uses quantum features like the no-cloning theorem and quantum key distribution. The proposed scheme has security properties like source hiding, non-transferability, and message anonymity. The proposed scheme is resistant to many quantum attacks, such as eavesdropping and impersonation. Due to designated verification, the scheme minimizes the risk of tempering. This paper provides a detailed description of the proposed scheme and analyzes its security properties. Therefore, the proposed scheme is efficient, practical, and secure.

Mathematics•Aug 19, 2024•12 citations
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.
Abstract Quantum voting allows us to design voting scheme by quantum mechanics. The existing quantum voting protocols (QVPs) mainly use quantum entangled states. However, the existing protocols consider the problem of repeated voting and tampered voting by malicious voters, and hybrid QVPs have not been discussed. In this paper, we use EFI pairs (Entity-Friendly Integer pairs) instead of quantum entangled states to address the shortage of existing protocols, and propose a new QVP. Our protocol is structured to avoid repeated voting by any voter, and can prevent the leakage of voters’ voting information. The security of our protocol can be finally reduced to a classical assumption i.e. BQP = QMA. In addition, compared with the existing results, our protocol has fewer interaction rounds. Combined with post-quantum key distribution, we further optimize the protocol to prevent malicious adversaries from interfering with the final voting results. Moreover, we use extended noisy trapdoor claw-free function (ENTCF) to construct the first hybrid QVP, which allows a classical voter to interact with a quantum center through a classical channel to complete the voting process.
The rapid advancement of internet technology has raised attention to the importance of electronic voting in maintaining democracy and fairness in elections. E-voting refers to the use of electronic technology to facilitate the casting and counting of votes in elections. The need for designated verification arises from concerns about voter privacy, auditability, and the prevention of manipulation. Traditional e-voting systems use cryptographic techniques for security but lack verifiable proof of integrity. Integrating e-voting with a quantum designated verifier could address these challenges by leveraging the principles of quantum mechanics to enhance security and trustworthiness. In light of this, we propose a quantum e-voting scheme that uses a designated verifier signature. To ensure the confidentiality and authenticity of the voting process, the scheme uses quantum features like the no-cloning theorem and quantum key distribution. The proposed scheme has security properties like source hiding, non-transferability, and message anonymity. The proposed scheme is resistant to many quantum attacks, such as eavesdropping and impersonation. Due to designated verification, the scheme minimizes the risk of tempering. This paper provides a detailed description of the proposed scheme and analyzes its security properties. Therefore, the proposed scheme is efficient, practical, and secure.