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

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

Quantum Secure Communication Based on Nonmaximally Entangled Qubit Pair and Dining Cryptographers Problem

Ronghua Shi, Qian Su, Ying Guo, Moon Ho Lee

Published Nov 1, 2011• 3 citations
Publisher

Abstract

A novel quantum anonymous communication scheme is proposed on the basis of Dining Cryptographers (DC) Problem and nonmaximally entangled qubit pair. The scheme takes advantage of quantum-mechanical impossibility of local unitary transformation between certain nonmaximally entangled states to provide truly random number which can be brightly used in anonymous communication protocols based on DC-Nets. The analysis and discussions demonstrate that the proposed quantum anonymous communication scheme can be performed securely with high capacity and untraceability. The scheme can also be extended to a (2, 2) quantum secret sharing (QSS) scheme.

DOI
10.1109/trustcom.2011.123

Related papers

QUANTUM COMMUNICATION BETWEEN ANONYMOUS SENDER AND ANONYMOUS RECEIVER IN THE PRESENCE OF STRONG ADVERSARY

Jan Bouda, Josef Šprojcar

While many scenarios of anonymous communication can be solved by various famous classical techniques including mix nets or dining cryptographers (DC), an abundant amount of anonymous tasks remains open. In this paper, we present a solution to one such task. Our protocol serves as a private communication channel for quantum messages while ensuring that both the sender and the receiver stay anonymous in a set of all parties. Our protocol is a continuation of our previous work on anonymous transmission of quantum information. The protocol does not require trusted parties, and is secure against an active adversary. It can also withstand denial of service attacks. The protocol exhibits an advantage of quantum resources over classical because no classical solution is known (in the same security settings). Entanglement swapping technique is used to create "symmetry" in the protocol, which makes it very transparent and easier to analyze. The security analysis we present is heavily based on our previous work on quantum anonymous communication. The task we implement is also a nice illustration of a cryptographic task where two parties in a multi-party protocol can be dishonest at the same time, but are not cooperating.

International Journal of Quantum Information•Mar 1, 2011•3 citations

Two-way protocols for quantum cryptography with a nonmaximally entangled qubit pair

Kaoru Shimizu, Kiyoshi Tamaki, Hiroyuki Fukasaka

This paper proposes a scheme for quantum cryptography with a nonmaximally entangled qubit pair. In a two-way configuration similar to quantum super dense coding, a two-bit key can be distributed by a round trip of one particle of the qubit pair and received by an appropriate joint measurement with the other. The security of our scheme is based on the quantum-mechanical impossibility of local unitary transformation between certain nonmaximally entangled states. Although an eavesdropper, Eve, can always identify the quantum state and intercept the key, it is impossible for her to resend the state with a unity probability and the legitimate parties inevitably detect her. Our protocol is also capable to quantum secure direct communication.

Physical Review A•Aug 19, 2009•35 citations

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

A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem

Peristera Karananou, Theodore Andronikos

This paper presents an innovative entanglement-based protocol to address the Dining Cryptographers problem, utilizing maximally entangled |GHZn⟩ tuples as its core. This protocol aims to provide scalability in terms of both the number of cryptographers n and the amount of anonymous information conveyed, represented by the number of qubits m within each quantum register. The protocol supports an arbitrary number of cryptographers n, enabling scalability in both participant count and the volume of anonymous information transmitted. While the original Dining Cryptographers problem focused on a single bit of information—whether a cryptographer paid for dinner—the proposed protocol allows m, the number of qubits in each register, to be any arbitrarily large positive integer. This flexibility allows the transmission of additional information, such as the cost of the dinner or the timing of the arrangement. Another noteworthy aspect of the introduced protocol is its versatility in accommodating both localized and distributed versions of the Dining Cryptographers problem. The localized scenario involves all cryptographers gathering physically at the same location, such as a local restaurant, simultaneously. In contrast, the distributed scenario accommodates cryptographers situated in different places, engaging in a virtual dinner at the same time. Finally, in terms of implementation, the protocol accomplishes uniformity by requiring that all cryptographers utilize identical private quantum circuits. This design establishes a completely modular quantum system where all modules are identical. Furthermore, each private quantum circuit exclusively employs the widely used Hadamard and CNOT quantum gates, facilitating straightforward implementation on contemporary quantum computers.

arXiv:2401.16679•Dynamics•Mar 8, 2024•1 citation

Experimental Quantum Solution to the Dining Cryptographers Problem

Alley Hameedi, Breno Marques, Muhammad, Sadiq +2 more

Quantum resources such as superposition and entanglement have been used to provide unconditional key distribution, secret sharing and communication complexity reduction. In this letter we present a novel quantum information protocol for dining cryptographers problem and anonymous vote casting by a group of voters. We successfully demonstrate the experimental realization of the protocol using single photon transmission. Our implementation employs a flying particle scheme where a photon passes by the voters who perform a sequence of actions (unitary transformations) on the photonic state at their local stations.

arXiv:1702.01984•Feb 7, 2017•2 citations

Enhanced quantum secret sharing protocol for anonymous secure communication utilizing W states

Guodong Li, Wen-Chuan Cheng, Qingle Wang +3 more

Quantum secret sharing (QSS) represents the fusion of quantum mechanics principles with secret information sharing, allowing a sender to distribute a secret among receivers for collective recovery. This paper introduces the concept of quantum anonymous secret sharing (QASS) to enhance the practicality of such protocols. We propose a QASS protocol leveraging W states, ensuring both recover-security and anonymity of shared secrets. Our protocol undergoes rigorous evaluation verifying their accuracy and fortifying their security against scenarios involving the active adversary. Additionally, acknowledging the imperfections inherent in real-world communication channels, we conduct a comprehensive analysis of protocol security and efficacy in noisy quantum networks. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.

iScience•Apr 29, 2024•14 citations
A novel quantum anonymous communication scheme is proposed on the basis of Dining Cryptographers (DC) Problem and nonmaximally entangled qubit pair. The scheme takes advantage of quantum-mechanical impossibility of local unitary transformation between certain nonmaximally entangled states to provide truly random number which can be brightly used in anonymous communication protocols based on DC-Nets. The analysis and discussions demonstrate that the proposed quantum anonymous communication scheme can be performed securely with high capacity and untraceability. The scheme can also be extended to a (2, 2) quantum secret sharing (QSS) scheme.
While many scenarios of anonymous communication can be solved by various famous classical techniques including mix nets or dining cryptographers (DC), an abundant amount of anonymous tasks remains open. In this paper, we present a solution to one such task. Our protocol serves as a private communication channel for quantum messages while ensuring that both the sender and the receiver stay anonymous in a set of all parties. Our protocol is a continuation of our previous work on anonymous transmission of quantum information. The protocol does not require trusted parties, and is secure against an active adversary. It can also withstand denial of service attacks. The protocol exhibits an advantage of quantum resources over classical because no classical solution is known (in the same security settings). Entanglement swapping technique is used to create "symmetry" in the protocol, which makes it very transparent and easier to analyze. The security analysis we present is heavily based on our previous work on quantum anonymous communication. The task we implement is also a nice illustration of a cryptographic task where two parties in a multi-party protocol can be dishonest at the same time, but are not cooperating.
This paper proposes a scheme for quantum cryptography with a nonmaximally entangled qubit pair. In a two-way configuration similar to quantum super dense coding, a two-bit key can be distributed by a round trip of one particle of the qubit pair and received by an appropriate joint measurement with the other. The security of our scheme is based on the quantum-mechanical impossibility of local unitary transformation between certain nonmaximally entangled states. Although an eavesdropper, Eve, can always identify the quantum state and intercept the key, it is impossible for her to resend the state with a unity probability and the legitimate parties inevitably detect her. Our protocol is also capable to quantum secure direct communication.
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.
This paper presents an innovative entanglement-based protocol to address the Dining Cryptographers problem, utilizing maximally entangled |GHZn⟩ tuples as its core. This protocol aims to provide scalability in terms of both the number of cryptographers n and the amount of anonymous information conveyed, represented by the number of qubits m within each quantum register. The protocol supports an arbitrary number of cryptographers n, enabling scalability in both participant count and the volume of anonymous information transmitted. While the original Dining Cryptographers problem focused on a single bit of information—whether a cryptographer paid for dinner—the proposed protocol allows m, the number of qubits in each register, to be any arbitrarily large positive integer. This flexibility allows the transmission of additional information, such as the cost of the dinner or the timing of the arrangement. Another noteworthy aspect of the introduced protocol is its versatility in accommodating both localized and distributed versions of the Dining Cryptographers problem. The localized scenario involves all cryptographers gathering physically at the same location, such as a local restaurant, simultaneously. In contrast, the distributed scenario accommodates cryptographers situated in different places, engaging in a virtual dinner at the same time. Finally, in terms of implementation, the protocol accomplishes uniformity by requiring that all cryptographers utilize identical private quantum circuits. This design establishes a completely modular quantum system where all modules are identical. Furthermore, each private quantum circuit exclusively employs the widely used Hadamard and CNOT quantum gates, facilitating straightforward implementation on contemporary quantum computers.
Quantum resources such as superposition and entanglement have been used to provide unconditional key distribution, secret sharing and communication complexity reduction. In this letter we present a novel quantum information protocol for dining cryptographers problem and anonymous vote casting by a group of voters. We successfully demonstrate the experimental realization of the protocol using single photon transmission. Our implementation employs a flying particle scheme where a photon passes by the voters who perform a sequence of actions (unitary transformations) on the photonic state at their local stations.
Quantum secret sharing (QSS) represents the fusion of quantum mechanics principles with secret information sharing, allowing a sender to distribute a secret among receivers for collective recovery. This paper introduces the concept of quantum anonymous secret sharing (QASS) to enhance the practicality of such protocols. We propose a QASS protocol leveraging W states, ensuring both recover-security and anonymity of shared secrets. Our protocol undergoes rigorous evaluation verifying their accuracy and fortifying their security against scenarios involving the active adversary. Additionally, acknowledging the imperfections inherent in real-world communication channels, we conduct a comprehensive analysis of protocol security and efficacy in noisy quantum networks. Our investigations reveal that W states exhibit good performance in mitigating noise interference, making them apt for practical applications.