基于量子傅里叶变换求和的量子投票协议

Quantum Voting Protocol Based on Quantum Fourier Transform Summation

针对传统电子投票存在用户信息易被窃取,而现有量子投票普遍计算效率较低的问题,提出了一种基于量子傅里叶变换求和与向量编码结合的量子投票协议,各方通过量子傅里叶变换将自己的保密数值以单粒子态的形式纠缠叠加到发起方手中进行投票,并通过向量编码实现对候选者票数的保密排序,由获胜者公布票数及排名。通过IBM提供的量子计算模拟器对协议量子傅里叶变换求和的正确性进行了验证。通过理论分析证明了协议在面对截取-重发攻击、纠缠测量攻击、共谋攻击以及监听方-候选者攻击这4类攻击时均有较好的安全性,且与现有同类型量子投票方案相比,协议的效率较高。

To solve the problem that the user information is easy to be stolen in the traditional electronic voting,and the existing quantum voting generally has low computational efficiency,a quantum voting protocol based on the combination of quantum Fourier transform summation and vector coding is proposed.In the protocol,each particpant uses quantum Fourier transform to entangle their secret values into the hands of the initiator in the form of a single particle state to vote,and the secret ranking of candidates’votes is realized by vector coding,finally the winner announces the number of votes and ranking.The correctness of the quantum Fourier transform summation in the protocol is verified by the quantum computing simulator provided by IBM.Through theoretical analysis,it is proved that the protocol has good security against four kinds of attacks which are intercept-resend attack,entanglement measurement attack,collusion attack,monitor and candidate attack,and the efficiency of the protocol is higher than the existing quantum voting schemes of the same type.