Based on the ring signature approach, this paper proposes a quantum voting protocol using single-particle states where voters can choose their voters from among the candidates without revealing their identities. In this protocol, voters hide their voting information into the envelope prepared by the voting center and the vote-counter through the quantum Fourier transform and the unitary operation, the voting center and the vote-counter will each generate only half of the voter’s identity information, and the voter’s identity information is secured by the mutual supervision of the voting center and the vote-counter. Because the protocol uses single particle states, which effectively reduces the difficulty of implementing this protocol, the security analysis shows that the protocol is secure.
Based on the ring signature approach, this paper proposes a quantum voting protocol using single-particle states where voters can choose their voters from among the candidates without revealing their identities. In this protocol, voters hide their voting information into the envelope prepared by the voting center and the vote-counter through the quantum Fourier transform and the unitary operation, the voting center and the vote-counter will each generate only half of the voter’s identity information, and the voter’s identity information is secured by the mutual supervision of the voting center and the vote-counter. Because the protocol uses single particle states, which effectively reduces the difficulty of implementing this protocol, the security analysis shows that the protocol is secure.
In the paper, we present a kind of quantum voting protocol, which is based on controlled quantum teleportation of local unitary operations in non-symmetric quantum channel. In this protocol, the umpire CA with zero knowledge proof quantum identity authentication ensures voter’s anonymous identity authentication. The counting institution Bob generates a high-dimensional Greenberger-Horne-Zeilinger entangled state to establish a high-dimensional quantum communication channel. Performing the local unitary operation on their low-dimensional quantum ballot, voter’s quantum vote is teleportated by asymmetric matrix measurement and scrutineer Charlie auxiliary measuring. With the scrutineer Charlie’s help, Bob achieves the voting result by the output of unitary operation. Compared with other general quantum operation teleportation quantum voting protocol, the protocol utilizes the quantum information and transmission of quantum channel, which have different dimensions, so single particle information cannot be stolen, and can prevent forgery. The electoral process is fair and undeniable, owing to Charlie’s supervision. Since the success probability of quantum teleportation of local unitary operations is 1, the quantum voting is reliable.
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.
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.
Quantum information protocols offer significant advantages in properties such as security, anonymity, and privacy for communication and computing tasks. An application where guaranteeing the highest possible security and privacy is critical for democratic societies is electronic voting. As computational power continues to evolve, classical voting schemes may become increasingly vulnerable to information leakage. In this work, we present the experimental demonstration of an information-theoretically secure and efficient electronic voting protocol that, crucially, does not rely on election authorities, leveraging the unique properties of quantum states. Our experiment is based on a high-performance source of Greenberger-Horne-Zeilinger (GHZ) states and realizes a proof-of-principle implementation of the protocol in two scenarios: a configuration with four voters and two candidates employing privacy enhancement techniques and an election scenario supporting up to eight voters and sixteen candidates. The latter is particularly well-suited for secure board-level elections within organizations or small-scale governmental contexts.
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.
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.