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

arXiv:2507.05460

Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication

Asgar Hosseinnezhad, H. Sabri

Published Jul 7, 2025• 0 citations
arXivHTMLPDF

Abstract

Current quantum communication protocols rely heavily on classical authentication for message origin verification, leaving them vulnerable to evolving attacks that exploit classical trust assumptions. In this work, we propose a novel framework for secure quantum relay networks that completely avoids classical authentication. Instead, we leverage pre-distributed entanglement graphs and non-classical correlation-assisted decoding to enable exclusive message retrieval by designated nodes without broadcasting any key or handshake. The system routes messages across multiple relay nodes, yet ensures that no intermediate node can access the message unless it possesses the entangled state partner. We demonstrate that even in multi-path scenarios with asynchronous entanglement distribution, the protocol guarantees quantum-forward secrecy and end-to-end origin integrity without trusted intermediaries. Simulation results confirm both functionality and robustness under entanglement loss and imperfect detection. This architecture paves the way for scalable quantum communication systems where physical quantum states replace classical authentication mechanisms entirely.

DOI
10.48550/arxiv.2507.05460

Related papers

Recent Developments in Quantum Network Cybersecurity: Exploiting Authentication Protocols to Secure Multi-User Quantum Communication

Abhilash Narayanan, Shiva Shankar Mummidi, Ramanan Sathiaseelan +3 more

A novel approach to secure data transmission, quantum communication draws on fundamental principles of quantum physics. It ensures that the transmitted information is private and accurate. To provide security, quantum networks implement physical constraints such as the no-cloning rule and quantum entanglement. In contrast, computational complexity is employed by classical networks. However, with the proliferation of multiuser quantum networks, identity verification has become more challenging. People with malicious intentions might easily disrupt services in long-distance quantum networks by impersonating legitimate nodes and sharing entangled resources and quantum channels. This highlights the absolute necessity of secure authentication systems tailored to quantum environments. Enhancements to recent quantum authentication systems have been made utilizing techniques that are resistant to quantum computing. Researchers are looking into quantum digital signatures, entanglement-assisted protocols, and quantum key distribution (QKD) authentication to make multi-party communications more secure. In order to prevent attacks where a user establishes a fraudulent identity or account, these strategies can be applied to quantum networks. This study takes a look at current quantum authentication systems and gives them the once-over, focusing on how well they could handle multiple users. The article delves into the evolution of authentication systems to accommodate the distributed model, where nodes can function as senders, receivers, or relays. We aim to strike a compromise between practicality and security in our lightweight, low-latency protocols. Additionally, the paper discusses quantum-specific issues, such as side-channel attacks and device malfunctions, and how authentication techniques can help prevent them. Finally, this study demonstrates that authentication is the critical component of secure quantum communication for multiple users. The most secure quantum key distribution methods are still vulnerable to attacks from inside or outside the system if proper authentication is not in place.

IEEE International Conference on ICT in Business Industry & Government (ICTBIG)•Dec 12, 2025•0 citations

Quantum Information Transmission Over Quantum Relay Channels

Yigal Ilin, Uzi Pereg

Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the trade-off between repeater-assisted and repeaterless communication strategies. Specifically, we propose a partial decode-forward strategy, in which quantum ``message system" consists of two components. The first component is decoded by the relay and then sent to the destination receiver, whereas the second component is decoded by the destination receiver without the relay's help. We analyze both entanglement-assisted and unassisted scenarios. As a special case, the full decode-forward strategy is recovered, with the relay decoding, re-encoding, and forwarding the entire message. Our framework allows for different entanglement topologies between the transmitter, the relay and the destination receiver, recovering known results on entanglement-assisted and unassisted communication. Furthermore, we discuss the interpretation of coding with quantum side information. These findings provide a foundation for designing secure, efficient, and reliable quantum networks and for realizing practical quantum repeaters and long-range quantum key distribution.

arXiv:2507.06770•Jul 9, 2025•2 citations

Quantum Entanglement-Based Distributed Data Verification

Jincheng Zhang

This paper proposes a novel approach to distributed data verification leveraging the unique properties of quantum entanglement. The core claim is that a highly secure distributed data verification system can be achieved without the need for shared keys, even when individual nodes are compromised. The proposed mechanism involves constructing a network of multiple quantum processors, each storing a portion of the data. Utilizing entangled states, real-time verification of relationships between data blocks is performed, and any detected alteration is immediately flagged. Quantum Key Distribution (QKD) protocols based on entangled states serve as the underlying communication foundation. This approach fundamentally differs from existing distributed data verification methods, which rely on key exchange and are therefore vulnerable to key compromise. The inherent principles of quantum mechanics provide a stronger security guarantee, theoretically offering superior resistance to attacks. This system aims to establish a robust and secure data integrity framework in scenarios demanding high levels of trust and protection against malicious manipulation.

•Sep 2, 2026•0 citations

Anonymous Classical Message Transmission Through Various Quantum Networks

Runhua Shi, Xia-qin Fang

Quantum network is a trending internet technology that exploits quantum mechanics principles to allow the communication between distant users. When a message is transmitted through a quantum network, guaranteeing the anonymity of a sender and a receiver is a fundamental property and formidable challenge. In this paper, we investigate anonymous classical message transmission through different quantum networks. Firstly, we establish various quantum network architectures, which can perfectly achieve anonymous communications without authenticated private channels, pre-shared keys or pre-distributed entanglements between any two users, and do not require complex routing through other users. Secondly, we present three practical and feasible quantum anonymous communication protocols for a ring quantum network, a linear quantum network, and a tree or graph mixed quantum network, respectively, which can ensure the information-theoretical security in semi-honest model and resist all side-channel attacks for measurement devices. Theoretical analysis and simulation experiments verify the feasibility of our proposed quantum protocols.

IEEE Transactions on Network Science and Engineering•Jan 16, 2024•11 citations

Distributed information-theoretical secure protocols for quantum key distribution networks against malicious nodes

Yi Luo, Qiong Li, Haokun Mao

Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.

arXiv:2302.07688•Journal of Optical Communications and Networking•Aug 7, 2024•10 citations

Hacking the Least Trusted Node: Indirect Eavesdropping in Quantum Networks

Stefan Raß, Miralem Mehić, Miroslav Vozn̆ák +1 more

We study the significance of the common trusted relay assumption in quantum networks. While most practical implementations of quantum networks rely on trusted devices, the question of security without this assumption has been rarely addressed. Device independent security attempts to minimize the assumptions made on the quantum hardware, entanglement based methods try to avoid relays to the extent possible, and multipath transmission improves robustness and security by enforcing the attacker to conquer more than just a single intermediate node. Common to all these past studies is their focus on the physical layer and direct connections. We describe an attack from the networking and routing layer. Assuming at least one node that is not perfectly tamper-proof, meaning that an attacker has established a foothold to read traffic from the inside, we show how to exploit the eavesdropping detection mechanisms of the quantum key distribution (QKD) devices to cause traffic redirection over the vulnerable node, thus defeating security under the trusted node assumption. We experimentally demonstrate how the attack works on networks of different size and topology, and thereby further substantiate the significance of the trust assumptions for end-to-end security of QKD networks.

IEEE Access•Jan 1, 2024•9 citations
Current quantum communication protocols rely heavily on classical authentication for message origin verification, leaving them vulnerable to evolving attacks that exploit classical trust assumptions. In this work, we propose a novel framework for secure quantum relay networks that completely avoids classical authentication. Instead, we leverage pre-distributed entanglement graphs and non-classical correlation-assisted decoding to enable exclusive message retrieval by designated nodes without broadcasting any key or handshake. The system routes messages across multiple relay nodes, yet ensures that no intermediate node can access the message unless it possesses the entangled state partner. We demonstrate that even in multi-path scenarios with asynchronous entanglement distribution, the protocol guarantees quantum-forward secrecy and end-to-end origin integrity without trusted intermediaries. Simulation results confirm both functionality and robustness under entanglement loss and imperfect detection. This architecture paves the way for scalable quantum communication systems where physical quantum states replace classical authentication mechanisms entirely.
A novel approach to secure data transmission, quantum communication draws on fundamental principles of quantum physics. It ensures that the transmitted information is private and accurate. To provide security, quantum networks implement physical constraints such as the no-cloning rule and quantum entanglement. In contrast, computational complexity is employed by classical networks. However, with the proliferation of multiuser quantum networks, identity verification has become more challenging. People with malicious intentions might easily disrupt services in long-distance quantum networks by impersonating legitimate nodes and sharing entangled resources and quantum channels. This highlights the absolute necessity of secure authentication systems tailored to quantum environments. Enhancements to recent quantum authentication systems have been made utilizing techniques that are resistant to quantum computing. Researchers are looking into quantum digital signatures, entanglement-assisted protocols, and quantum key distribution (QKD) authentication to make multi-party communications more secure. In order to prevent attacks where a user establishes a fraudulent identity or account, these strategies can be applied to quantum networks. This study takes a look at current quantum authentication systems and gives them the once-over, focusing on how well they could handle multiple users. The article delves into the evolution of authentication systems to accommodate the distributed model, where nodes can function as senders, receivers, or relays. We aim to strike a compromise between practicality and security in our lightweight, low-latency protocols. Additionally, the paper discusses quantum-specific issues, such as side-channel attacks and device malfunctions, and how authentication techniques can help prevent them. Finally, this study demonstrates that authentication is the critical component of secure quantum communication for multiple users. The most secure quantum key distribution methods are still vulnerable to attacks from inside or outside the system if proper authentication is not in place.
Quantum relays are central to both quantum communication and distributed quantum computing, enabling long-distance transmission and modular architectures. Unlike classical repeaters, quantum repeaters preserve coherence without amplifying quantum information, relying on entanglement swapping and quantum error correction to overcome loss and decoherence. In this work, we investigate the transmission of quantum information via quantum relay channels. Our three-terminal relay model captures the trade-off between repeater-assisted and repeaterless communication strategies. Specifically, we propose a partial decode-forward strategy, in which quantum ``message system" consists of two components. The first component is decoded by the relay and then sent to the destination receiver, whereas the second component is decoded by the destination receiver without the relay's help. We analyze both entanglement-assisted and unassisted scenarios. As a special case, the full decode-forward strategy is recovered, with the relay decoding, re-encoding, and forwarding the entire message. Our framework allows for different entanglement topologies between the transmitter, the relay and the destination receiver, recovering known results on entanglement-assisted and unassisted communication. Furthermore, we discuss the interpretation of coding with quantum side information. These findings provide a foundation for designing secure, efficient, and reliable quantum networks and for realizing practical quantum repeaters and long-range quantum key distribution.
This paper proposes a novel approach to distributed data verification leveraging the unique properties of quantum entanglement. The core claim is that a highly secure distributed data verification system can be achieved without the need for shared keys, even when individual nodes are compromised. The proposed mechanism involves constructing a network of multiple quantum processors, each storing a portion of the data. Utilizing entangled states, real-time verification of relationships between data blocks is performed, and any detected alteration is immediately flagged. Quantum Key Distribution (QKD) protocols based on entangled states serve as the underlying communication foundation. This approach fundamentally differs from existing distributed data verification methods, which rely on key exchange and are therefore vulnerable to key compromise. The inherent principles of quantum mechanics provide a stronger security guarantee, theoretically offering superior resistance to attacks. This system aims to establish a robust and secure data integrity framework in scenarios demanding high levels of trust and protection against malicious manipulation.
Quantum network is a trending internet technology that exploits quantum mechanics principles to allow the communication between distant users. When a message is transmitted through a quantum network, guaranteeing the anonymity of a sender and a receiver is a fundamental property and formidable challenge. In this paper, we investigate anonymous classical message transmission through different quantum networks. Firstly, we establish various quantum network architectures, which can perfectly achieve anonymous communications without authenticated private channels, pre-shared keys or pre-distributed entanglements between any two users, and do not require complex routing through other users. Secondly, we present three practical and feasible quantum anonymous communication protocols for a ring quantum network, a linear quantum network, and a tree or graph mixed quantum network, respectively, which can ensure the information-theoretical security in semi-honest model and resist all side-channel attacks for measurement devices. Theoretical analysis and simulation experiments verify the feasibility of our proposed quantum protocols.
Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.
We study the significance of the common trusted relay assumption in quantum networks. While most practical implementations of quantum networks rely on trusted devices, the question of security without this assumption has been rarely addressed. Device independent security attempts to minimize the assumptions made on the quantum hardware, entanglement based methods try to avoid relays to the extent possible, and multipath transmission improves robustness and security by enforcing the attacker to conquer more than just a single intermediate node. Common to all these past studies is their focus on the physical layer and direct connections. We describe an attack from the networking and routing layer. Assuming at least one node that is not perfectly tamper-proof, meaning that an attacker has established a foothold to read traffic from the inside, we show how to exploit the eavesdropping detection mechanisms of the quantum key distribution (QKD) devices to cause traffic redirection over the vulnerable node, thus defeating security under the trusted node assumption. We experimentally demonstrate how the attack works on networks of different size and topology, and thereby further substantiate the significance of the trust assumptions for end-to-end security of QKD networks.