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

Quantum Anonymous Veto with Hardy Paradox

Ramij Rahaman, Marcin Wieśniak, Marek Żukowski

Published Mar 1, 2013• 0 citations
OpenAlex

Abstract

The Anonymous Veto (or dining cryptographers) problem, which allows a voting party in a jury to anonymously veto a decision, which is to be approved unanimously, has a classical solution in form of a protocol, security of which is guaranteed only by computational hardness. We present a generalization to a multi qu$D$it case of Hardy's argument against local realism, which avoids statistical inequalities, and show that generalized Hardy-type correlations allow a simple quantum solution of the problem. This is possible because Hardy-type conditions for correlations precisely determine a specific genuine multipartite entangled state, which can satisfy them.

Related papers

GHZ correlation provides secure Anonymous Veto Protocol

Ramij Rahaman, Guruprasad Kar

Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems where the main aim is to hide the identity of the senders of the messages. These can be achieved by classical methods where the security is based either on computational hardness or on shared private keys. In this regard, we present a secure quantum protocol for both DC and AV by exploiting the GHZ correlations. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV. Securities for both the protocols rely on some novel and fundamental features of GHZ correlations related to quantum nonlocality.

arXiv:1507.00592•Jul 2, 2015•7 citations

Quantum anonymous one vote veto protocol based on entanglement swapping

Y. H. Wang, Min Jiang, Yuzhen Wei +1 more

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.

IET Quantum Communication•Dec 1, 2024•1 citation

Single-Round Deterministic Quantum Anonymous Veto Using Bell States

Ravi Sangwan, Mishra, Harishankar, Henry Sukumar +1 more

Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making by allowing participants to detect the presence of a veto without revealing individual choices. While existing QAV schemes offer strong theoretical guarantees, they face significant limitations in practical implementation due to resource requirements, scalability issues, and the need for multipartite entanglement. In this work, we propose a novel deterministic QAV protocol that leverages only bipartite entanglement in the form of Bell states and achieves conclusive veto detection in a single round. Our approach eliminates the need for multi-qubit entangled states and iterative rounds, thereby significantly reducing experimental overhead and enhancing scalability. The protocol preserves critical properties such as voter anonymity, correctness, and verifiability, making it well-suited for implementation on near-term quantum devices. Furthermore, we outline a practical photonic realization based on polarization-path encoding and discrete-time quantum walks, demonstrating its feasibility within current quantum optical platforms. This work contributes a resource-efficient and experimentally viable alternative to existing QAV schemes, advancing the prospects of secure quantum decision-making in distributed systems.

arXiv:2509.15951•Sep 19, 2025•0 citations

Quantum anonymous veto: a set of new protocols

Sandeep Mishra, Kishore Thapliyal, Abhishek Parakh +1 more

Abstract We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based deterministic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.

arXiv:2109.06260•EPJ Quantum Technology•May 20, 2022•28 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

True multipartite entanglement Hardy test

Ramij Rahaman, Marcin Wieśniak, Marek Żukowski

Quantum mechanics allows systems to be entangled with each other, which results in stronger than classical correlations. Many methods of identifying entanglement have been proposed over years, most of which are based on violating some statistical inequalities. In this work we extend the idea formed by Hardy, in which entanglement is not identified with the use of statistical inequalities, but by simultaneous satisfaction of certain conditions. We show that this variant of the Hardy paradox relying on marginal probabilities can be resolved only by true multipartite entangled states. Also, the state resolving this paradox for given local measurements is pure and unique in the case of qubit collections.

arXiv:1303.0128•Physical Review A•Dec 24, 2014•13 citations
The Anonymous Veto (or dining cryptographers) problem, which allows a voting party in a jury to anonymously veto a decision, which is to be approved unanimously, has a classical solution in form of a protocol, security of which is guaranteed only by computational hardness. We present a generalization to a multi quDDDit case of Hardy's argument against local realism, which avoids statistical inequalities, and show that generalized Hardy-type correlations allow a simple quantum solution of the problem. This is possible because Hardy-type conditions for correlations precisely determine a specific genuine multipartite entangled state, which can satisfy them.
Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems where the main aim is to hide the identity of the senders of the messages. These can be achieved by classical methods where the security is based either on computational hardness or on shared private keys. In this regard, we present a secure quantum protocol for both DC and AV by exploiting the GHZ correlations. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV. Securities for both the protocols rely on some novel and fundamental features of GHZ correlations related to quantum nonlocality.
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.
Quantum Anonymous Veto (QAV) protocols enable secure and anonymous decision-making by allowing participants to detect the presence of a veto without revealing individual choices. While existing QAV schemes offer strong theoretical guarantees, they face significant limitations in practical implementation due to resource requirements, scalability issues, and the need for multipartite entanglement. In this work, we propose a novel deterministic QAV protocol that leverages only bipartite entanglement in the form of Bell states and achieves conclusive veto detection in a single round. Our approach eliminates the need for multi-qubit entangled states and iterative rounds, thereby significantly reducing experimental overhead and enhancing scalability. The protocol preserves critical properties such as voter anonymity, correctness, and verifiability, making it well-suited for implementation on near-term quantum devices. Furthermore, we outline a practical photonic realization based on polarization-path encoding and discrete-time quantum walks, demonstrating its feasibility within current quantum optical platforms. This work contributes a resource-efficient and experimentally viable alternative to existing QAV schemes, advancing the prospects of secure quantum decision-making in distributed systems.
Abstract We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized under the probabilistic, iterative, and deterministic schemes. The schemes are based upon different types of quantum resources. Specifically, they may be viewed as single photon-based, bipartite and multipartite entangled states-based, orthogonal state-based and conjugate coding-based. The set of the proposed schemes is analyzed for all the requirements of a valid QAV scheme (e.g., privacy, verifiability, robustness, binding, eligibility and correctness). The proposed schemes are observed to be more efficient in comparison to the existing QAV schemes and robust up to the moderate decoherence rate. In addition, a trade-off between correctness and robustness of the probabilistic QAV schemes is observed. Further, the multipartite dense coding based deterministic QAV scheme is most efficient scheme among the set of schemes proposed here. A bipartite entanglement based iterative scheme employing dense coding is yet another efficient and practical scheme. The intrinsic connections between dining cryptographer-net with anonymous veto-net is also explored in the process of designing new protocols.
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.
Quantum mechanics allows systems to be entangled with each other, which results in stronger than classical correlations. Many methods of identifying entanglement have been proposed over years, most of which are based on violating some statistical inequalities. In this work we extend the idea formed by Hardy, in which entanglement is not identified with the use of statistical inequalities, but by simultaneous satisfaction of certain conditions. We show that this variant of the Hardy paradox relying on marginal probabilities can be resolved only by true multipartite entangled states. Also, the state resolving this paradox for given local measurements is pure and unique in the case of qubit collections.