A Mobile Quantum Voting Method Based on Chinese Remainder Theorem

Abstract

The invention discloses a mobile quantum voting method based on Chinese remainder theorem, which is characterized in that a supervisor, a teller and a plurality of voters exist. A quantum state is prepared by the supervisor, moreover, the quantum state is divided into two, one part of quantum bits are sent to the voters to serve as quantum votes, and the other part of the quantum bits are sent tothe teller to serve as vote-checking certificates; each voter performs voting operation on the same quantum vote, the quantum votes are sent to the teller for counting and verification after all voting operations are complete, and ultimately, voting results of all the voters are obtained. The objective of the invention is to solve the problem that conventional mobile voting cannot resist secondaryvoting attacks of dishonest voters and the problem that excessive quantum resource is consumed by conventional distributive voting, and the security of voting operation is enhanced.

Description

technical field [0001] The invention relates to the field of quantum mobile voting and quantum summation, in particular to a mobile voting method using the idea of ​​quantum summation in order to prevent secondary voting and save quantum resources. Background technique [0002] In today's society, voting is widely used as an election tool. From class elections to class committees to national elections of leading cadres, decisions are made by voting. Based on the existing technical conditions, electronic voting technology has been applied in real society. In the past 20 years, scholars have proposed many electronic voting protocols and voting schemes, most of which are based on blind signature and group signature technology. These technologies are all classical cryptography, and their security is based on the computational complexity of deciphering the key, which does not satisfy unconditional security, and cannot resist future quantum computer attacks. [0003] Based on th...

AI Technical Summary

Problems solved by technology

[0010] The purpose of the present invention is to solve the problems that the existing mobile voting protocol cannot resist secondary voting attacks by malicious voters, and the quantum resource consumption of the existing distributed quantum voting scheme is too large, and the corresponding quantum communication complexity is too high. Based on the idea of ​​quantum summation, a mobile voting method based on quantum summation is proposed, in order to resist the secondary voting attack of malicious voters, thereby improving the security of voting operations and reducing the consumption of quantum resources and communication complexity.

Images