Quantum voting system and method based on quantum teleportation

Abstract

The invention discloses a quantum voting system and method based on quantum teleportation. The quantum voting system comprises a voter Alice, a voting management organization CA, a supervisor Charlie,a teller Bob and four OADMs, wherein the voter Alice comprises a first a quantum key server, a voting terminal and a first quantum state measurement device; the voting management organization CA comprises a second quantum key server, an authentication terminal, an entanglement source and a first Bell state measurement device; the supervisor Charlie comprises a third quantum key server, a displayterminal and a second Bell state measurement device; and the teller Bob comprises a fourth quantum key server, a computer terminal, a unitary transformation device and a second quantum state measurement device. The quantum voting system disclosed by the invention ensures the security of the whole voting process by the coherence of entangled particles, a QKD protocol, a one-time-one-encryption encryption algorithm and quantum channel eavesdropping detection. In addition, the quantum voting system disclosed by the invention transmits the classical and quantum information through different wavelengths in the same optical fiber, so that the cost of an application can be greatly reduced, and the practicability is improved

Description

technical field [0001] The invention relates to a quantum voting scheme, in particular to a quantum teleportation-based quantum voting system and method. Background technique [0002] At present, the informatization of countries in the world is developing rapidly, and information technology has a more profound impact on politics, economy, society and culture. The first electronic election protocol in the sense of cryptography was proposed by Chaum. This protocol is based on Mix-net and encrypts information through public key cryptography. The length of encrypted messages and the amount of user calculations in this scheme are the same as the number of Mix net servers. Proportionally, it is not suitable for large-group elections, and the protocol cannot guarantee that voters' identities will not be tracked. Later, Chaum proposed an unconditionally anonymous election protocol, the main idea of ​​which is "Dinning Cryptographers Problem". In this protocol, the identity of vote...

AI Technical Summary

Problems solved by technology

[0004] In 2005, in the quantum election scheme proposed by Vaccaro et al., each voter represents the content of his vote by performing different local operations on the quantum state representing the vote, and finally all voters’ choices are encoded into the phase of the same entangled state Information, the vote tellers count the election results according to the measurement results, this protocol can guarantee the anonymity of the election, but this scheme requires a complicated measurement process to read the election results

The protocol needs to be carried out in a semi-honest mode, and a distributed protocol is proposed to prevent election administrators from falsifying votes, but only one final election result is announced, which is not verifiable

Images