Abstract To better protect the privacy of voters, a receipt-free quantum voting protocol is first proposed, which adopts quantum key agreement and quantum public key encryption with single photons. We employ Lagrange interpolation polynomials and random numbers to blind the voting information on the bulletin board, so that it can minimize the public information. Furthermore, our receipt-free quantum voting protocol is information-theoretically secure, i.e., the eavesdropper cannot get any voting information by collecting both the quantum ciphertext and the public information. In addition, compared with the existing quantum voting protocols, our protocol can meet more security attributes, such as anonymity, unrepeatability, verifiability legitimacy and especially, receipt-freeness.Abstract To better protect the privacy of voters, a receipt-free quantum voting protocol is first proposed, which adopts quantum key agreement and quantum public key encryption with single photons. We employ Lagrange interpolation polynomials and random numbers to blind the voting information on the bulletin board, so that it can minimize the public information. Furthermore, our receipt-free quantum voting protocol is information-theoretically secure, i.e., the eavesdropper cannot get any voting information by collecting both the quantum ciphertext and the public information. In addition, compared with the existing quantum voting protocols, our protocol can meet more security attributes, such as anonymity, unrepeatability, verifiability legitimacy and especially, receipt-freeness.

Physica ScriptaMay 10, 20239 citations

An Improved Quantum Voting Scheme

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

International Journal of Theoretical PhysicsJul 27, 201810 citations

An Elaborate Secure Quantum Voting Scheme

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

International Journal of Theoretical PhysicsJul 12, 201727 citations

Toward protocols for quantum-ensured privacy and secure voting

Marianna C. Bonanome, Vladimír Bužek, Mark S. Hillery +1 more

We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see M. Hillery, M. Ziman, V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and M. Bielikov\'a, Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multiparty function evaluation. We consider functions corresponding to group multiplication of $N$ group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see M. Hillery, M. Ziman, V. Bu\ifmmode \check{z}\else \v{z}\fi{}ek, and M. Bielikov\'a, Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multiparty function evaluation. We consider functions corresponding to group multiplication of $N$ group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.

arXiv:1108.5090Physical Review AAug 24, 201153 citations

N

group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.