A Secure Quantum Protocol for Anonymous One-Vote Veto Voting

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 mathbb {Z} and mathbb {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.

Cite

CITATION STYLE

APA

Wu, S., Sun, W., Wang, Q., Che, R., Hu, M., DIng, Z., & Xue, X. (2021). A Secure Quantum Protocol for Anonymous One-Vote Veto Voting. IEEE Access, 9, 146841–146849. https://doi.org/10.1109/ACCESS.2021.3123681

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free