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

International Conference on Quantum, Nano and Micro Technologies (ICQNM)

Secure Message Relay over Networks with QKD-Links

Stefan Raß, Mohamed Ali Sfaxi, Solange Ghernaouti-Hélie, Kyandoghere Kyamakya

Published Feb 1, 2008• 9 citations
Publisher

Abstract

This paper presents extensions to the classical point- to-point protocol PPP [RFC1661] and IPSEC [RFC 2401] in order to build networks that can do unconditionally secure message relay. Our work addresses the problem of how to integrate quantum key distribution (QKD) in networks such that little effort needs to be put on protocol engine adaption and network topology design. This article demonstrates how to ensure correct routing and secure authentication between adjacent QKD-capable nodes, in particular, it is demonstrated how a person-in-the-middle attack can be countered using universal hash functions.

DOI
10.1109/icqnm.2008.14

Related papers

Joint Routing and Relay Key Allocation in Quantum Key Distribution Networks for Communication Security

Peng‐Yong Kong

There is a need to ensure unconditionally secure communications between different sites of an organization. We use quantum key distribution (QKD) protocol to provide a continuous stream of secret key bits to each communicating pair for message encryption through one-time-pad (OTP) cryptography. Due to long distance between different sites, trusted nodes are used to relay each service key in a hop-by-hop manner from one end node to another end node of a communicating pair. In a QKD network, routes for key relaying can be affected by availability of relay key bits at trusted nodes. Also, relay key allocation among different routes can impact security. We consider the scenario of supporting multiple communicating pairs, where each pair demands delivery of a certain service key rate across the QKD network, and trusted nodes may not have sufficient relay key rates to perform bitwise encryption to protect the service key. Hence, there is a need to allocate the limited relay key bits to meet all service key delivery demands while considering its effects on security. We propose to perform jointly routing and relay key allocation to minimize attack success probability. We have formulated the joint problem as an optimization and further proposed an efficient algorithm to find the optimal solutions. We have evaluated the proposed algorithm to confirm its ability and efficiency in finding optimal routes and relay key allocations. For the specific network topology that we have adopted, results show that the minimum number of required trusted nodes increases linearly when end nodes are added to the system. Furthermore, we can achieve a higher security level by adding more trusted nodes in a QKD network. But increasing the number of trusted nodes beyond the minimum requirement may not continue to reduce significantly the attack success probability.

IEEE Transactions on Networking•Oct 30, 2025•1 citation

ACHIEVING UNCONDITIONAL SECURITY IN EXISTING NETWORKS USING QUANTUM CRYPTOGRAPHY

Stefan Raß, Mohamed Ali Sfaxi, Solange Ghernaouti-Hélie

Based on extensions to the protocols PPP and IPSEC, we present a working proposal for building a network over which messages can be sent unconditionally secure. We will show how quantum cryptography can be implemented in classical protocols and how existing networks can be efficiently extended to suit our needs for unconditional security. We show that graph connectivity is crucial for the security of the transmission. For that matter, we provide secure routing services, so an adversary cannot penetrate any message flow successfully. Furthermore, our protocols are extensible to allow up to t - 1 adversaries (possibly cooperating) while remaining unconditionally secure.

International Conference on Security and Cryptography•Jan 1, 2006•2 citations

A routing method designed for a Quantum Key Distribution network

Yoshimichi Tanizawa, Ririka Takahashi, A. R. Dixon

Quantum Key Distribution (QKD) is a technique for sharing encryption keys between two adjacent nodes in an unconditionally secure manner based on quantum theory. From the viewpoint of network system research, QKD is considered to be a building block for providing secure link communication in network systems. Although the communication distance is subject to a limitation attributable to the QKD fundamentals, recent research and some QKD field trials of “key relaying” over a “QKD network” are overcoming this limitation. It also enables each node on the QKD network to exchange encryption keys with arbitrary nodes on the QKD network. However, the previous research didn't address a routing method on the QKD network in detail. This paper focuses on the routing issues on the QKD network, clarifies the requirements of the routing protocol, and proposes a routing solution designed for the key relaying on the QKD network. The proposed routing solution consists of 4 components: (1) a node interface architecture addressing both encrypted and unencrypted traffics, (2) a path selection algorithm based on the number of keys, (3) an IP address assignment scheme connecting unencrypted interfaces and encrypted interfaces, and (4) a routing protocol deployment method consuming no extra keys. The proposed routing solution allows the QKD network to select a suitable key relaying path according to the QKD system condition and to reduce the extra key consumption, which optimizes the key utilization on the QKD network. The proposed routing solution was implemented with a network emulating QKD technology and evaluated. The evaluation result shows that the proposed routing solution could select a path that stores enough keys, which is suitable for a QKD network. Additional impact analysis reveals that the proposed routing solution could save up to 52% of key consumption depending on the QKD key sharing speed and the routing protocol configuration.

International Conference on Ubiquitous and Future Networks•Jul 1, 2016•44 citations

Challenges of Routing in Quantum Key Distribution Networks with Trusted Nodes for Key Relaying

Peng‐Yong Kong

Quantum key distribution (QKD) protocols generate a same secret key at two nodes which are at different locations. Such key is used to encrypt and decrypt messages for unconditionally secure communications through a classical channel. Originally, QKD protocols are designed to work between two nodes which are directly connected through a point-to-point quantum channel. Currently, commercial QKD systems have limited range and key rate. To increase key rate and extend range, the key generated by QKD at one end node is relayed hop-by-hop to the other end node through multiple trusted nodes. In a QKD network with multiple pairs of communicating nodes, routing deals with the issue of deciding for each pair, which trusted nodes are used to form a path connecting the end nodes. This paper presents an overview of QKD and highlights the differences between QKD routing as compared to classical routing. The challenges of QKD routing are presented. Existing works dealing with the challenges are surveyed. This paper ends with a discussion on remaining research issues.

IEEE Communications Magazine•Sep 19, 2023•20 citations

Secure Quantum Relay Networks Using Distributed Entanglement without Classical Authentication

Asgar Hosseinnezhad, H. Sabri

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.

arXiv:2507.05460•Jul 7, 2025•0 citations

Indirect Eavesdropping in Quantum Networks

Stefan Raß, Sandra König

Quantum networks are communication networks in which adjacent nodes enjoy perfectly secure channels thanks to quantum key distribution (QKD). Drawing end- to-end security from QKD-supported point-to-point security can be done by virtue of multipath transmission. This concept buys security at the cost of strongly connected networks and perfect routing. Particularly the latter is hard to ensure, since congestions or (passive) may cause QKD key- buffers to run empty, thus enforcing local re-routing of packets. Hence, the adversary may use not to extract information, but to redirect the information flow towards a relay-node that he controls. Such attacks can readily invalidate the stringent requirements of multipath transmission protocols and thus defeat any formal arguments for perfect secrecy. Moreover, this form of indirect eavesdropping seems to be unconsidered in the literature so far. We investigate whether or not unconditional security in a quantum network with non- reliable routing is possible. Using Markov-chains, we derive various sufficient criteria for retaining perfect secrecy under imperfect packet relay. In particular, we explicitly do not assume trusted relay or quantum repeaters available. Keywords-Quantum Cryptography, Markov-Chain, Secure

•Jan 1, 2011•4 citations
This paper presents extensions to the classical point- to-point protocol PPP [RFC1661] and IPSEC [RFC 2401] in order to build networks that can do unconditionally secure message relay. Our work addresses the problem of how to integrate quantum key distribution (QKD) in networks such that little effort needs to be put on protocol engine adaption and network topology design. This article demonstrates how to ensure correct routing and secure authentication between adjacent QKD-capable nodes, in particular, it is demonstrated how a person-in-the-middle attack can be countered using universal hash functions.
There is a need to ensure unconditionally secure communications between different sites of an organization. We use quantum key distribution (QKD) protocol to provide a continuous stream of secret key bits to each communicating pair for message encryption through one-time-pad (OTP) cryptography. Due to long distance between different sites, trusted nodes are used to relay each service key in a hop-by-hop manner from one end node to another end node of a communicating pair. In a QKD network, routes for key relaying can be affected by availability of relay key bits at trusted nodes. Also, relay key allocation among different routes can impact security. We consider the scenario of supporting multiple communicating pairs, where each pair demands delivery of a certain service key rate across the QKD network, and trusted nodes may not have sufficient relay key rates to perform bitwise encryption to protect the service key. Hence, there is a need to allocate the limited relay key bits to meet all service key delivery demands while considering its effects on security. We propose to perform jointly routing and relay key allocation to minimize attack success probability. We have formulated the joint problem as an optimization and further proposed an efficient algorithm to find the optimal solutions. We have evaluated the proposed algorithm to confirm its ability and efficiency in finding optimal routes and relay key allocations. For the specific network topology that we have adopted, results show that the minimum number of required trusted nodes increases linearly when end nodes are added to the system. Furthermore, we can achieve a higher security level by adding more trusted nodes in a QKD network. But increasing the number of trusted nodes beyond the minimum requirement may not continue to reduce significantly the attack success probability.
Based on extensions to the protocols PPP and IPSEC, we present a working proposal for building a network over which messages can be sent unconditionally secure. We will show how quantum cryptography can be implemented in classical protocols and how existing networks can be efficiently extended to suit our needs for unconditional security. We show that graph connectivity is crucial for the security of the transmission. For that matter, we provide secure routing services, so an adversary cannot penetrate any message flow successfully. Furthermore, our protocols are extensible to allow up to t - 1 adversaries (possibly cooperating) while remaining unconditionally secure.
Quantum Key Distribution (QKD) is a technique for sharing encryption keys between two adjacent nodes in an unconditionally secure manner based on quantum theory. From the viewpoint of network system research, QKD is considered to be a building block for providing secure link communication in network systems. Although the communication distance is subject to a limitation attributable to the QKD fundamentals, recent research and some QKD field trials of “key relaying” over a “QKD network” are overcoming this limitation. It also enables each node on the QKD network to exchange encryption keys with arbitrary nodes on the QKD network. However, the previous research didn't address a routing method on the QKD network in detail. This paper focuses on the routing issues on the QKD network, clarifies the requirements of the routing protocol, and proposes a routing solution designed for the key relaying on the QKD network. The proposed routing solution consists of 4 components: (1) a node interface architecture addressing both encrypted and unencrypted traffics, (2) a path selection algorithm based on the number of keys, (3) an IP address assignment scheme connecting unencrypted interfaces and encrypted interfaces, and (4) a routing protocol deployment method consuming no extra keys. The proposed routing solution allows the QKD network to select a suitable key relaying path according to the QKD system condition and to reduce the extra key consumption, which optimizes the key utilization on the QKD network. The proposed routing solution was implemented with a network emulating QKD technology and evaluated. The evaluation result shows that the proposed routing solution could select a path that stores enough keys, which is suitable for a QKD network. Additional impact analysis reveals that the proposed routing solution could save up to 52% of key consumption depending on the QKD key sharing speed and the routing protocol configuration.
Quantum key distribution (QKD) protocols generate a same secret key at two nodes which are at different locations. Such key is used to encrypt and decrypt messages for unconditionally secure communications through a classical channel. Originally, QKD protocols are designed to work between two nodes which are directly connected through a point-to-point quantum channel. Currently, commercial QKD systems have limited range and key rate. To increase key rate and extend range, the key generated by QKD at one end node is relayed hop-by-hop to the other end node through multiple trusted nodes. In a QKD network with multiple pairs of communicating nodes, routing deals with the issue of deciding for each pair, which trusted nodes are used to form a path connecting the end nodes. This paper presents an overview of QKD and highlights the differences between QKD routing as compared to classical routing. The challenges of QKD routing are presented. Existing works dealing with the challenges are surveyed. This paper ends with a discussion on remaining research issues.
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.
Quantum networks are communication networks in which adjacent nodes enjoy perfectly secure channels thanks to quantum key distribution (QKD). Drawing end- to-end security from QKD-supported point-to-point security can be done by virtue of multipath transmission. This concept buys security at the cost of strongly connected networks and perfect routing. Particularly the latter is hard to ensure, since congestions or (passive) may cause QKD key- buffers to run empty, thus enforcing local re-routing of packets. Hence, the adversary may use not to extract information, but to redirect the information flow towards a relay-node that he controls. Such attacks can readily invalidate the stringent requirements of multipath transmission protocols and thus defeat any formal arguments for perfect secrecy. Moreover, this form of indirect eavesdropping seems to be unconsidered in the literature so far. We investigate whether or not unconditional security in a quantum network with non- reliable routing is possible. Using Markov-chains, we derive various sufficient criteria for retaining perfect secrecy under imperfect packet relay. In particular, we explicitly do not assume trusted relay or quantum repeaters available. Keywords-Quantum Cryptography, Markov-Chain, Secure