Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

An Elaborate Secure Quantum Voting Scheme

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

Published Jul 12, 2017• 27 citations
Publisher
DOI
10.1007/s10773-017-3468-6

Related papers

A Secure Voting Scheme Based on Quantum Walk

Bai Liu, Kuikui Guo, Pengda Zhu +1 more

Lecture notes in computer science•Jan 1, 2024•0 citations

A Secure Quantum Voting Scheme Based on Quantum Group Blind Signature

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

International Journal of Theoretical Physics•Dec 19, 2019•19 citations

A Secure Quantum Voting Scheme Based on Orthogonal Product States

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

International Journal of Theoretical Physics•Apr 1, 2021•6 citations

A Secure Quantum Voting Protocol with Rich Roles

Xiaohua Liu, Xiaojun Wen, Xincan Fan +1 more

•Oct 1, 2017•0 citations

An Improved Quantum Voting Scheme

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

International Journal of Theoretical Physics•Jul 27, 2018•10 citations

A Secure Quantum Protocol for Anonymous One-Vote Veto Voting

Songyang Wu, Wenqi Sun, Qingle Wang +4 more

Voting is one of the most prominent components of democracy. The one-vote veto, which requires the voting result to be only “yes” or “no”, is a particularly noteworthy type of voting with widespread application. When obtaining a “no” result, no useful information about the number of “no” votes and who votes “no” is disclosed. In this paper, we introduce a protocol for anonymous one-vote veto utilizing qubits and local Pauli operations Z and X, building simple processes for easy implementation under the current technology. For better elaboration, we give two examples: all voters cast “yes” votes and only one voter casts a "no." Then, the corresponding experiment tests are conducted on the simulated IBM quantum computer to verify their feasibility.We also show that the proposed protocol has the desirable properties of privacy, fairness, verifiability and robustness. Furthermore, we analyze the proposed protocol’s security against cheating from eavesdroppers, a semi-honest server and malicious voters. This work is the first attempt to illustrate how qubits can be useful for building a secure anonymous one-vote veto strategy.

IEEE Access•Jan 1, 2021•6 citations
Voting is one of the most prominent components of democracy. The one-vote veto, which requires the voting result to be only “yes” or “no”, is a particularly noteworthy type of voting with widespread application. When obtaining a “no” result, no useful information about the number of “no” votes and who votes “no” is disclosed. In this paper, we introduce a protocol for anonymous one-vote veto utilizing qubits and local Pauli operations Z and X, building simple processes for easy implementation under the current technology. For better elaboration, we give two examples: all voters cast “yes” votes and only one voter casts a "no." Then, the corresponding experiment tests are conducted on the simulated IBM quantum computer to verify their feasibility.We also show that the proposed protocol has the desirable properties of privacy, fairness, verifiability and robustness. Furthermore, we analyze the proposed protocol’s security against cheating from eavesdroppers, a semi-honest server and malicious voters. This work is the first attempt to illustrate how qubits can be useful for building a secure anonymous one-vote veto strategy.