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.
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.
We propose a lightweight post-quantum authentication scheme for multi-hop QKD relay networks, designed to replace client-side mutual transport layer security (TLS) with a more efficient and verifiable mechanism. The protocol combines an additional random source, a Wegman–Carter message authentication code (MAC), and a Dilithium-2 signature, providing 128-bit integrity and strong post-quantum guarantees without relying on client certificates or traditional public key infrastructures. Authentication material is embedded directly into the payload of key forwarding messages, enabling each relay to verify its predecessor in a hop-by-hop fashion. An optional cryptographically verifiable chain allows each relay to attest to the authenticity of previous hops without requiring interactive exchanges or revealing local secrets. This design eliminates the latency and complexity associated with repeated TLS handshakes, while enabling path-level auditing through chained proofs of authenticity. We validate the approach in a hybrid testbed combining simulated trusted nodes with ID Quantique Clavis 3 hardware, where nearly 700 key exchanges were executed across four hops. Experimental results show a 28% reduction in end-to-end latency compared to mutual TLS, stable signature costs below 0.4 ms, and predictable payload growth under chained verification, confirming both practicality and scalability.
Quantum communication networks promise information-theoretic security but this security collapses if intermediate relay nodes are compromised, a risk that grows sharply when compromised nodes cannot be identified. We address this twofold: first, we show that multi-path routing provides quantifiable protection against unidentified compromised nodes. Second, we provide a comprehensive statistical and graph-theoretic analysis of network and node security under compromise, covering full and partial node compromise, optimal placement of additional edges via an iterative method, and comparative hacking-probability analysis across network topologies. Together, these results identify the topology and multi-path routing strategy that most improves security for a given network. We apply this framework to quantum key distribution across multiple network topologies, demonstrating a scalable route to secure, reliable quantum communication under realistic, unidentified adversarial threats, without relying on quantum memory.