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

EPJ Quantum Technology

Quantum anonymous collision detection for quantum networks

Awais Khan, Uman Khalid, Junaid ur Rehman, Kyesan Lee, Hyundong Shin

Published Dec 1, 2021• 16 citations
Publisher

Abstract

Abstract Quantum mechanics offers new opportunities for diverse information processing tasks in communication and computational networks. In the last two decades, the notion of quantum anonymity has been introduced in several networking tasks that provide an unconditional secrecy of identity for the communicating parties. In this article, we propose a quantum anonymous collision detection (QACD) protocol which detects not only the collision but also guarantees the anonymity in the case of multiple senders. We show that the QACD protocol serves as an important primitive for a quantum anonymous network that features tracelessness and resource efficiency. Furthermore, the security analysis shows that this protocol is robust against the adversary and malicious participants.

DOI
10.1140/epjqt/s40507-021-00116-9

Related papers

Multi-participant quantum anonymous communication based on high-dimensional entangled states

Jiawei Liu, Qing-Xia Mu, Ronghua Che +3 more

Abstract Anonymous quantum communication (AQC) enables the secure transmission of quantum or classical messages between a sender and a receiver while ensuring the anonymity of their identities. Existing AQC protocols primarily address one-to-one anonymous communication. When there are multiple senders, they must send their messages sequentially to avoid collision problems. In this paper, we propose a multi-participant quantum anonymous communication (MQAC) by employing high-dimensional entangled states. In this protocol, multiple senders establish anonymous entanglement with multiple receivers of their choice and send quantum messages anonymously and simultaneously via quantum teleportation. To propose MQAC, we first present the toolbox we developed, which includes several sub-protocols such as the verification protocol, collision detection protocol, address distribution protocol, and notification protocol. These sub-protocols, which we propose, not only are important parts of MQAC but also serve as the foundation for solving many more complex tasks, such as anonymous commodity transaction. Additionally, the analysis of MQAC demonstrates that neither internal nor external attackers can steal the identities of the communication parties or the transmitted messages by employing any attack. Our work represents an original exploration of anonymous message transmission between multiple senders and receivers in quantum networks.

Physica Scripta•Jul 31, 2024•2 citations

Device-Independent Anonymous Communication in Quantum Networks

Srijani Das, Manasi Patra, Tuhin Paul +2 more

Anonymity is a fundamental cryptographic primitive that hides the identities of both senders and receivers during message transmission over a network. Classical protocols cannot provide information-theoretic security for such task, and existing quantum approaches typically depend on classical subroutines and multiple private channels, thereby weakening their security in fully adversarial settings. In this work, we introduce the first fully quantum protocol for anonymous communication in realistic quantum networks with a device-independent security proof.

quant-pharXiv:2512.21047•Dec 25, 2025•0 citations

Quantum Anonymity for Quantum Networks

Awais Ali Khan, Junaid ur Rehman, Hyundong Shin

We present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum computation to quantum internet. We utilize the QAN protocol to propose an anonymous quantum private comparison protocol in an $n$-node quantum network. This protocol can compare private information of any $2 \leq k \leq n$ parties with the help of the remaining $n-k$ parties and a semi-honest third party. These protocols feature a traceless property, i.e., encoding operations cannot be traced back to their originating sources. Security analysis shows that this protocol is robust against external adversaries and malicious participants.

arXiv:2007.11176•Jul 22, 2020•2 citations

Quantum communication for sender anonymity based on single-particle with collective detection

Yuancheng Li, Chaohang Yu, Qingle Wang +1 more

Abstract Nowadays, identity protection has turned into a fundamental demand for online activities. Currently, the present quantum anonymous communication protocols mostly rely on multi-entanglement. In this paper, we propose an anonymous communication protocol for anonymous sender by using single-particle states. The protocol can be extended to a communication protocol where the sender and receiver are fully anonymous with the message kept secret. In terms of security, our protocol is designed to comply with the technique of collective detection. Compared to the step-by-step detection, collective detection, in which the participants perform detection only once, reduces the complexity of the protocol to some extent. Moreover, we analytically demonstrate the security of the protocol in the face of active attacks. Any active attack employed by an external or internal attacker cannot reveal any useful information about the sender’s identity. Meanwhile, any malicious behavior will be detected by honest participants.

Physica Scripta•Dec 1, 2021•5 citations

Quantum anonymous selection and its applications

Runhua Shi, Xia-qin Fang

In this paper, we introduce what we believe to be a novel cryptographic primitive in secure multiparty computation, called anonymous selection (AS). This cryptographic primitive involves the random and anonymous selection of one participant from a group, ensuring that no one, except the selected individual, can identify who has been chosen. The AS concept holds significant potential for simplifying complex cryptographic tasks by enabling their implementation in a sequential manner rather than a synchronous one. To develop an efficient and practical AS protocol, we first propose two new primitive protocols: a measurement-device-independent (MDI) quantum secure multiparty XOR protocol and an MDI quantum collision detection protocol. Leveraging these protocols, we construct an innovative quantum AS protocol that achieves information-theoretic security under the semi-honest model. Furthermore, we explore the practical applications of the quantum AS protocol and present a feasible quantum protocol for secure multiparty logical multiplication. Our theoretical analysis and simulation experiments collectively demonstrate the feasibility of the proposed quantum protocols.

Optics Express•Apr 15, 2025•0 citations

Anonymous and secret communication in quantum networks

Christopher Thalacker, Frederik Hahn, Jarn de Jong +2 more

Abstract Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks. Here, we demonstrate that quantum physics allows parties—besides communicating securely over a network—to also keep their identities secret. We implement such an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network. We demonstrate the protocol with four parties and establish keys in subsets of the network—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.

arXiv:2103.08722•New Journal of Physics•Jul 27, 2021•29 citations
Abstract Quantum mechanics offers new opportunities for diverse information processing tasks in communication and computational networks. In the last two decades, the notion of quantum anonymity has been introduced in several networking tasks that provide an unconditional secrecy of identity for the communicating parties. In this article, we propose a quantum anonymous collision detection (QACD) protocol which detects not only the collision but also guarantees the anonymity in the case of multiple senders. We show that the QACD protocol serves as an important primitive for a quantum anonymous network that features tracelessness and resource efficiency. Furthermore, the security analysis shows that this protocol is robust against the adversary and malicious participants.
Abstract Anonymous quantum communication (AQC) enables the secure transmission of quantum or classical messages between a sender and a receiver while ensuring the anonymity of their identities. Existing AQC protocols primarily address one-to-one anonymous communication. When there are multiple senders, they must send their messages sequentially to avoid collision problems. In this paper, we propose a multi-participant quantum anonymous communication (MQAC) by employing high-dimensional entangled states. In this protocol, multiple senders establish anonymous entanglement with multiple receivers of their choice and send quantum messages anonymously and simultaneously via quantum teleportation. To propose MQAC, we first present the toolbox we developed, which includes several sub-protocols such as the verification protocol, collision detection protocol, address distribution protocol, and notification protocol. These sub-protocols, which we propose, not only are important parts of MQAC but also serve as the foundation for solving many more complex tasks, such as anonymous commodity transaction. Additionally, the analysis of MQAC demonstrates that neither internal nor external attackers can steal the identities of the communication parties or the transmitted messages by employing any attack. Our work represents an original exploration of anonymous message transmission between multiple senders and receivers in quantum networks.
Anonymity is a fundamental cryptographic primitive that hides the identities of both senders and receivers during message transmission over a network. Classical protocols cannot provide information-theoretic security for such task, and existing quantum approaches typically depend on classical subroutines and multiple private channels, thereby weakening their security in fully adversarial settings. In this work, we introduce the first fully quantum protocol for anonymous communication in realistic quantum networks with a device-independent security proof.
We present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum computation to quantum internet. We utilize the QAN protocol to propose an anonymous quantum private comparison protocol in an nnn-node quantum network. This protocol can compare private information of any 2≤k≤n2 \leq k \leq n2≤k≤n parties with the help of the remaining n−kn-kn−k parties and a semi-honest third party. These protocols feature a traceless property, i.e., encoding operations cannot be traced back to their originating sources. Security analysis shows that this protocol is robust against external adversaries and malicious participants.
Abstract Nowadays, identity protection has turned into a fundamental demand for online activities. Currently, the present quantum anonymous communication protocols mostly rely on multi-entanglement. In this paper, we propose an anonymous communication protocol for anonymous sender by using single-particle states. The protocol can be extended to a communication protocol where the sender and receiver are fully anonymous with the message kept secret. In terms of security, our protocol is designed to comply with the technique of collective detection. Compared to the step-by-step detection, collective detection, in which the participants perform detection only once, reduces the complexity of the protocol to some extent. Moreover, we analytically demonstrate the security of the protocol in the face of active attacks. Any active attack employed by an external or internal attacker cannot reveal any useful information about the sender’s identity. Meanwhile, any malicious behavior will be detected by honest participants.
In this paper, we introduce what we believe to be a novel cryptographic primitive in secure multiparty computation, called anonymous selection (AS). This cryptographic primitive involves the random and anonymous selection of one participant from a group, ensuring that no one, except the selected individual, can identify who has been chosen. The AS concept holds significant potential for simplifying complex cryptographic tasks by enabling their implementation in a sequential manner rather than a synchronous one. To develop an efficient and practical AS protocol, we first propose two new primitive protocols: a measurement-device-independent (MDI) quantum secure multiparty XOR protocol and an MDI quantum collision detection protocol. Leveraging these protocols, we construct an innovative quantum AS protocol that achieves information-theoretic security under the semi-honest model. Furthermore, we explore the practical applications of the quantum AS protocol and present a feasible quantum protocol for secure multiparty logical multiplication. Our theoretical analysis and simulation experiments collectively demonstrate the feasibility of the proposed quantum protocols.
Abstract Secure communication is one of the key applications of quantum networks. In recent years, following the demands for identity protection in classical communication protocols, the need for anonymity has also emerged for quantum networks. Here, we demonstrate that quantum physics allows parties—besides communicating securely over a network—to also keep their identities secret. We implement such an anonymous quantum conference key agreement by sharing multipartite entangled states in a quantum network. We demonstrate the protocol with four parties and establish keys in subsets of the network—different combinations of two and three parties—whilst keeping the participating parties anonymous. We additionally show that the protocol is verifiable and run multiple key generation and verification routines. Our work thus addresses one of the key challenges of networked communication: keeping the identities of the communicating parties private.