Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.
Abstract To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.
Abstract In order to construct unconditionally secure anonymous countable veto protocol, we proposed a measurement-device-independent quantum secure multiparty authenticated summation protocol. This protocol adopts perfect quantum encryption and one-time pad to achieve unconditional security. In addition, the protocol uses the weak coherent pulses of the BB84 state as the quantum resource, and only needs to perform Bell state identification to complete the calculation. Combined with the idea of grouping, it is applied to the quantum anonymous veto voting scenario, which ensures the anonymity of the protocol. Under the semi-honest model, the security of the designed protocol is proved. It can satisfy the correctness, security and relatively complete voting attributes. Finally, IBM Qiskit is used to carry out simulation experiments, and the experimental results verify the correctness and feasibility of the protocol.
Abstract As a special voting method, one‐vote veto voting also has a wide range of applications. A veto means that when the voting council puts forward a proposal, it cannot pass unless all the voters agree to it. If there is a no vote, the proposal will be rejected, but no one will know how anyone else votes. In most existing quantum anonymous one‐vote veto voting protocols, an absolutely honest third party is generally required to assist the voting. However, it is difficult to find a fully trusted third party in reality. In addition, the existing quantum anonymous one‐vote veto protocol does not consider the attack from the insider voters. Therefore, based on the characteristics of entanglement swapping between the Cat state and Bell state, the authors propose a new quantum anonymous one‐vote veto protocol, which can not only calculate the voting result quickly and effectively but also demonstrate higher security.
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.
Abstract In this paper, we propose a measurement-device-independent (MDI) quantum secure multiparty summation protocol based on entanglement swapping. The protocol is capable of providing a secure modulo-2 summation method for n parties. Our protocol uses Bell states as the information vehicle and establishes encryption through entanglement swapping, and each party encodes the information orderly to complete the summation process through the simple single-qubit operation. In contrast to previous protocols, there is no pre-shared private key sequence and key storage process in our protocol, which helps to reduce the possibility of information leakage in transmission. Our protocol supports multiple summations by n participants, which improves quantum resource utilization. The protocol can be implemented with linear-optical devices. Furthermore, it can resist multiple attack modes including the intercept-resend attack, entangle-and-measure attack, dishonest third-party attack, and parties’ attack. Most significantly, the protocol enables to eliminate all side-channel attacks against detectors based on the MDI principle. Therefore, the protocol has advantages of high security, high efficiency, and good feasibility.
Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils and companies. In this paper, we propose a quantum anonymous voting protocol assisted by two kinds of entangled quantum states. Particularly, we provide a mechanism of opening and permuting the ordered votes of all the voters in an anonymous manner; any party who is interested in the voting results can acquire a permutation copy and then obtains the voting result through a simple calculation. Unlike all previous quantum works on anonymous voting, our quantum anonymous protocol possesses the properties of privacy, self-tallying, nonreusability, verifiability, and fairness at the same time. In addition, we demonstrate that the entanglement of the quantum states used in our protocol makes an attack from an outside eavesdropper and inside dishonest voters impossible. We also generalize our protocol to execute the task of anonymous multiparty computation, such as anonymous broadcast and anonymous ranking.
Self-tallying quantum anonymous voting (SQAV) has drawn considerable attention since it was proposed. However, constrained by design challenges, all existing protocols only accommodate single-selection voting and cannot support multi-selection voting. In this paper, we propose a SQAV protocol with multi-selection voting functionality. In our protocol, nmn-particle entangled states are equally divided into n groups, and the n particles in each entangled state are delivered to n voters, one particle per voter. Each voter obtains n voting vectors by sequentially measuring all his (or her) particles that belong to n different group, and then encodes his or her voting information into the vector corresponding to the secret index. Due to entanglement correlation, each voter can verify whether his or her ballot is correct through computation, while any participant can obtain the vote count for each candidate through computation. Our protocol satisfies self-tallying, nonreusability, verifiability, and fairness.