| With the development and maturity of information technology,and the increasingly frequent information sharing and exchange,electronic voting emerges at the historic moment and is gradually accepted and recognized.Compared with manual voting using the ballot box,voting on the Internet is more efficient and accurate,and avoids the insecurity of artificial operation,so that voting is more fair and secure,and it also guarantee the freedom of citizens to vote.Although traditional electronic voting improves the efficiency and security of voting to some extent,with the increase of computer computing power,the security of encryption methods based on large number decomposition,quadratic residue,discrete logarithm and so on is gradually reduced,which challenges the security of traditional electronic voting.Quantum voting can effectively solve the above problems faced by traditional electronic voting.Taking quantum voting protocol as the main research object,this paper analyzes the voting principles and core technologies of traditional electronic voting schemes and previous quantum voting schemes.Quantum of voting by the basic laws of quantum mechanics to ensure safety,and the uncertainty principle of quantum and not clone principle guarantees the malicious eavesdropping is in the process of quantum communication can be detected.The security of the traditional electronic voting is restricted to computing power of the computer,that is,the stroger the attacker’s computing power,the lower the voting security.In this paper,the characteristics and deficiencies of electronic voting based on secure multiparty summation are analyzed,and a new quantum voting protocol based on secure multiparty summation is proposed by applying quantum Fourier transform to secure multiparty summation.The protocol is mainly composed of summation and sorting.The security of the protocol is analyzed theoretically,and the correctness of the core of the protocol,namely the quantum summation part,is verified experimentally on IBM Q quantum computing cloud platform.The specific work of this paper is as follows:1.A secure multi-party quantum sorting protocol based on quantum summation is proposed.To solve the problem of low security and easy eavesdropping in traditional multi-party sorting,a secure multi-party quantum sorting protocol based on semi-honest model is proposed.All parties participated in the calculation based on the sum of quantum Fourier transform,and the ranking was obtained on the basis of the secret values not being leaked.A 32-qubit quantum computing simulator provided by IBM Q is used to verify the quantum multiparty summation in the protocol.The experimental results show that the summation scheme of the protocol is executed correctly and effectively.At the same time,the security of the protocol is analyzed theoretically from the aspects of interception-retransmission attack and internal participant attack.The protocol not only provides a new idea for the existing quantum sequencing,but also gives good consideration to fairness,validity and security.2.A quantum voting protocol is proposed which supports the simultaneous participation of multiple users.And the final result obtained by the initiator,against the confidentiality of traditional voting schemes is relatively insufficient,and the effciency of existing quantum voting schemes is low,Single round can only obtain voting vote of one participants.In the scheme,put forward a new based on quantum Fourier transform sum,in quantum theory of security features at the same time,a single candidate round all voters’ ballots and can be collected,and adding random operator operation,prevent the initiator modified as a result,the final vote candidates use sorting method.The scheme is theoretically safe against the attacker,and the quantum summation part of the voting protocol can be converted into a quantum circuit for experimental verification on the third-party platform IBM Q,which greatly reduces the user’s personal computing cost and lays a foundation for its application.Compared with other quantum voting schemes,the proposed scheme not only greatly improves the computational efficiency but also consumes less quantum bits to complete the computation under the premise of high security. |
