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

Journal of Shijiazhuang University

A Quantum Voting Scheme Based on the Correlation of Entanglement

LU Zhi-jia

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

A quantum voting scheme was proposed based on the quantum correlation of the triplet entangled state.We used the physical characteristics of quantum mechanics to implement voting,tallying and real-time monitoring,and adopted quantum key distribution and one-time pad in our scheme.This scheme overcame the limitations of calculation security in the classic electronic voting protocol;it has unconditional security.

Related papers

Secure quantum voting protocol

Xuejun Cai

Based on the actual demand for labor vote,a model and a protocol of quantum voting were proposed.This protocol overcame the limitations of calculation security in the classic electronic voting protocol,and had unconditional security.With the existing quantum vote protocol,real-time monitoring was used instead of post audit to oversee the verifier's behavior.The security and efficiency of our protocol were improved by reducing the technical difficulty.

Journal of Shandong University•Jan 1, 2011•7 citations

Are Quantum Voting Protocols Practical?

Nitin Jha, Abhishek Parakh

Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.

quant-pharXiv:2601.17514•Jan 27, 2026•0 citations

Quantum Voting Scheme Based on Qubits

Zhiqiang Yao

A quantum voting scheme is presented.Each voter can perform vote by using local unitary operation.According to measurement outcomes,the tally man can calculate the result of the vote.Then,we make accuracy analyses and privacy analyses on this scheme.It shows that this scheme is secure.Compared with the other quantum voting schemes using N-level entangled state,our scheme only refers to a 2-level quantum system,and the measurement is simple.Hence,the experimental realization of the protocol is feasible.

Journal of Putian University•Jan 1, 2009•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

A novel voting scheme using quantum cryptography

D. Sam Sundar, Nitin Narayan

Many problems shadow the traditional method of casting votes. The chief predicament faced is that the voting area is usually politically tense and votes are in the danger of being compromised or coerced while they are stored in each constituency and also when they are being transported to the final tallying destination. We propose a novel method in which votes are not cached in the voting machines but are transferred in real time to a predetermined secure location. To achieve this transfer we propound to use cryptographic methods and proceed to analyze which cryptosystem would be best suited for this application. We introduce our voting scheme which utilizes Quantum Key Distribution (QKD) and propose a novel latency examination technique to detect and thwart man-in-the-middle attacks that might be employed to hack QKD systems. Further we discuss the necessity for post quantum cryptography and research how we might use multivariate public key cryptography for our voting scheme in the post-quantum era.

IEEE Conference on Open Systems•Oct 1, 2014•8 citations

Blockchain-Based Voting System Using Quantum Computing

Gajal, Sadhna Gautam, Shalu Shalu

In the age of digital transformation, the integrity and security of online voting systems have become a growing concern. Traditional cryptography methods are vulnerable to advances in quantum computing, demanding the need for more secure alternatives. This paper explores the application of quantum cryptography in enhancing the security of blockchain-based voting systems, a decentralized and transparent approach to conduct elections. We introduce a novel quantum-resistant voting protocol that integrates Quantum Key Distribution (QKD) with post-quantum cryptographic algorithms, ensuring secure voter authentication, vote casting, and tallying. The methodology combines quantum encryption with blockchain's immutability to create a tamper-proof voting ledger, preventing unauthorized access and vote manipulation. It gives an analysis of potential real-world implementations, positioning a hybrid quantum-blockchain framework as a promising solution for future secure electronic voting systems.

International Conference on Networks and Cryptology (NETCRYPT)•May 1, 2025•1 citation
A quantum voting scheme was proposed based on the quantum correlation of the triplet entangled state.We used the physical characteristics of quantum mechanics to implement voting,tallying and real-time monitoring,and adopted quantum key distribution and one-time pad in our scheme.This scheme overcame the limitations of calculation security in the classic electronic voting protocol;it has unconditional security.
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.
A quantum voting scheme is presented.Each voter can perform vote by using local unitary operation.According to measurement outcomes,the tally man can calculate the result of the vote.Then,we make accuracy analyses and privacy analyses on this scheme.It shows that this scheme is secure.Compared with the other quantum voting schemes using N-level entangled state,our scheme only refers to a 2-level quantum system,and the measurement is simple.Hence,the experimental realization of the protocol is feasible.
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.
Many problems shadow the traditional method of casting votes. The chief predicament faced is that the voting area is usually politically tense and votes are in the danger of being compromised or coerced while they are stored in each constituency and also when they are being transported to the final tallying destination. We propose a novel method in which votes are not cached in the voting machines but are transferred in real time to a predetermined secure location. To achieve this transfer we propound to use cryptographic methods and proceed to analyze which cryptosystem would be best suited for this application. We introduce our voting scheme which utilizes Quantum Key Distribution (QKD) and propose a novel latency examination technique to detect and thwart man-in-the-middle attacks that might be employed to hack QKD systems. Further we discuss the necessity for post quantum cryptography and research how we might use multivariate public key cryptography for our voting scheme in the post-quantum era.
In the age of digital transformation, the integrity and security of online voting systems have become a growing concern. Traditional cryptography methods are vulnerable to advances in quantum computing, demanding the need for more secure alternatives. This paper explores the application of quantum cryptography in enhancing the security of blockchain-based voting systems, a decentralized and transparent approach to conduct elections. We introduce a novel quantum-resistant voting protocol that integrates Quantum Key Distribution (QKD) with post-quantum cryptographic algorithms, ensuring secure voter authentication, vote casting, and tallying. The methodology combines quantum encryption with blockchain's immutability to create a tamper-proof voting ledger, preventing unauthorized access and vote manipulation. It gives an analysis of potential real-world implementations, positioning a hybrid quantum-blockchain framework as a promising solution for future secure electronic voting systems.