A Secure Voting Scheme Based on Quantum Walk

Jia-Lei Zhang, Shu-Cui Xie, Jianzhong Zhang

Zhang Xiao, Jian-Zhong Zhang, Shu-Cui Xie

Gang Du, Bao-Min Zhou, Chunguang Ma +2 more

Wenhao Zhao, Min Jiang

Based on traveling ballot mode, we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger (GHZ) states. In this scheme, each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content. The voters have multiple ballot items to choose rather than just binary options “yes” or “no”. After counting votes phase, any participant who is interested in voting results can obtain the voting results. To improve the efficiency of the traveling quantum anonymous voting scheme, an optimization method based on grouping strategy is also presented. Compared with the most existing traveling quantum voting schemes, the proposed scheme is more practical because of its privacy, verifiability and non-repeatability. Furthermore, the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

Xu-Feng Niu, Jian-Zhong Zhang, Shu-Cui Xie +1 more

Dong, Hua, Yang, Li

Traditional cryptography is under huge threat along of the evolution of quantum information and computing. In this paper, we propose a new post-quantum voting scheme based on physical laws by using encrypted no-key protocol to transmit message in the channel, which ensures the post-quantum security. Unlike lattice-based and multivariate-based electronic voting schemes, whose security is based on the computational problems assumption that has not been solved by effective quantum algorithms until now, the security of the voting scheme based on the physical laws is depended on inherent limitations of quantum computers and not influenced by the evolution of new quantum algorithms. In detail, we also rigorously demonstrate that the scheme achieves the post-quantum security and all properties necessary for voting scheme such as the completeness, robustness, privacy, eligibility, unreusability, fairness, and verifiability.