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 Communications Standards Magazine

Distributed Key Relay: OSPF for Effective QKD

Youssouf Drif, Intidhar Bedhief, Symeon Chatzinotas

Published Jun 2, 2025• 6 citations
Publisher

Abstract

With the advent of powerful quantum computers, an emerging quantum-resilient security mechanism within existing networks is crucial. Thus, Quantum Key Distribution (QKD), which generates symmetric secret keys with Information-Theoretical Security (ITS) for secure point-to-point communication, is present as a solution. Despite QKD’s potential, its deployment is challenging due to significant investment and infrastructure requirements. Using state-of-the-art technology, the maximum distance between nodes is limited to hundreds of kilometers, necessitating multiple nodes to relay keys. For now, QKD Network (QKDN) relies on software-defined networking (SDN) and a central orchestrator, but this centralized approach has limitations. Hence, the main challenge is to select an efficient path between key relays to avoid communication failure. To address these challenges, a more distributed approach could be envisioned. In this paper, we propose to leverage one of the distributed routing protocols, OSPF, to redefine and improve the current architecture. We propose a novel QKDN-based OSPF (Open Shortest Path First) architecture for efficient key relay routing, offering a completely different dimension to the overall network management: we modify QKDN architecture to exploit the OSPF networks and present a QKD-enabled OSPF version capable of computing the best path for key relay, offering a cost-effective and scalable solution for widespread QKD adoption.

DOI
10.1109/mcomstd.2025.3572642

Related papers

Comparison of distributed and centralized quantum key management systems for meshed QKD networks

Mario Wenning, Jonas Berl, Tobias Fehenberger +1 more

Recent developments in quantum key distribution (QKD) demonstrate the maturity of securing sensitive data against the emerging quantum computing threat. For QKD-secured long-haul and meshed optical transport networks (OTNs), quantum key management systems (QKMSs) are essential to overcome current distance limitations of available QKD devices. In this work, we present and compare two implementations of QKMSs, analyzing their scalability with an emulated QKD network (QKDN) utilizing recorded performance metrics from deployed QKD devices. First, we use a state-of-the-art Internet routing scheme, i.e., open shortest path first (OSPF), demonstrating that key management entities (KMEs) can solve the key routing problem utilizing distributed routing. Second, we apply software-defined networking (SDN) to implement centralized routing with a SDN controller. This paper compares distributed with centralized key routing regarding scalability, throughput, and latency. Both schemes facilitate up to six key relays between any pair of nodes in parallel with average key relay durations per hop below 300 ms given the Nobel-Germany topology and any-to-any demand matrix. With a network-wide joint key routing optimization in the SDN controller, up to 16.7% higher demands can be served compared to distributed key routing. Within the inherent compatibility of our study to network-function virtualization (NFV), we guideline future integration of QKMSs into deployed OTNs.

Journal of Optical Communications and Networking•Jan 10, 2025•7 citations

Toward Quantum-Safe Scalable Networks: An Open, Standards-Aware Key Management Framework

Ane Sanz, Asier Atutxa, David Franco +3 more

With the advent of quantum computing, the increasing threats to security poses a great challenge to communication networks. Recent innovations in this field resulted in promising technologies such as Quantum Key Distribution (QKD), which enables the generation of unconditionally secure keys, establishing secure communications between remote nodes. Additionally, QKD networks enable the interconnection of multi-node architectures, extending the point-to-point nature of QKD. However, due to the limitations of the current state of technology, the scalability of QKD networks remains a challenge toward feasible implementations. When it comes to long-distance implementations, trusted relay nodes partially solve the distance issue through the forwarding of the distributed keys, allowing applications that do not have a direct QKD link to securely share key material. Even though the relay procedure itself has been extensively studied, the establishment of the relaying node path still lacks a solution. This paper proposes an innovative network architecture that solves the challenges of Key Management System (KMS) identification, relay path discovery, and scalability of QKD networks by integrating Software-Defined Networking (SDN) principles, and establishing high-level virtual KMSs (vKMS) in each node and creating a new entity called the Quantum Security Controller (QuSeC). The vKMS serves the end-user key requests, managing the multiple KMSs within the node and abstracting the user from discovering the correct KMS. Additionally, based on the high-level view of the network topology and status, the QuSeC serves the path discovery requests from vKMSs, computing the end-to-end (E2E) relay path and applying security policies. The paper also provides a security analysis of the proposal, identifying the security levels of the architecture and analyzing the core networking security properties, and a performance evaluation that confirms the feasibility and scalability of the proposal.

arXiv:2509.09453•IEEE Network•Dec 12, 2025•2 citations

Software Defined Networks Key Relay for Large-Scale Quantum Key Distribution Networks

Stephan Laschet, Gergely Lendvay, Thomas Lorünser +3 more

This work addresses the orchestration of large-scale Quantum Key Distribution Networks (QKDNs) using Software Defined Networking (SDN). Building on ETSI and ITU specifications, common best practices and architectures are outlined. The main task of the SDN Controller is to aggregate technical key performance indicators (KPI) from the network and, based on these, select the optimal path. Multiple path selection algorithms, based on Dijkstra or a maximum-minimum capacity algorithm, with built-in load balancing are presented. The algorithms were tested in simulations and their performances, and tradeoffs, are discussed. Additional critical aspects related to SDN controlled QKDNs are discussed, such as query batching, multi-path selection and group key capabilities. An oblivious multi-party protocol is proposed for relay path selection in a multi-domain scenario, so providers don't have to disclose sensitive information about their QKDN. These contributions aim to enhance scalability, resilience and interoperability in quantum-secure network infrastructures.

arXiv:2608.17539•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Routing Performance Based On Software Defined Quantum Key Distribution Network

Vivi Monita, Rendy Munadi, Indrarini Dyah Irawati

Quantum Key Distribution (QKD) takes a short time to process encryption and authentication messages as an advanced security key distribution. Open Shortest Path First (OSPF) routing used on existing QKD networks uses more security keys. Software-Defined Networking (SDN) exists to control the core network, make routes easier to find and reduce the use of security keys. One of the benefits of SDN is that the controller can customize the routing scheme and save the use of secure keys. Based on the topology and scenarios, the link state protocol test results show that using keys increased the number of hops traversed by five to fourteen keys. We can see the five keys constant when testing the distance vector protocol. The average test time difference between the two protocols is about 3.438 seconds for the link state protocol and 2.687 seconds for the distance vector algorithm.

IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob)•Dec 9, 2022•3 citations

Quantum Relay Nodes: Enhancing Security and Scalability in Quantum Key Distribution Networks

Abhijit Dey, Sujit Biswas, Saikat Bose +1 more

Quantum Key Distribution (QKD) has emerged as a promising technology for secure the communication because its security is achieved through the physical laws of quantum mechanics, rather than being based on mathematical problems. In most of the earlier implementations, QKD relied on the direct exchange of the secret keys between two users. Once implemented in a practical system outside of a controlled laboratory setting, QKD experiences complications associated with the limited distances, communication losses, and vulnerabilities to eavesdropping in the multi-user network configurations, compromising its ability to be this third-generation secure communication system. In this work, we show how quantum relay nodes can be implemented as points along a QKD network. The relay nodes provide additional advantages such as extending the communication distances, increasing eavesdropping resistance and allowing for more sophisticated configurations. While relying on theoretical models and experimentally motivated studies, this paper discusses advantages of implementing a relay architecture into a QKD network and highlights technical difficulties that need to be addressed prior to widespread implementation.

CRC Press eBooks•Sep 3, 2026•0 citations

Secure Key Relaying in Quantum Key Distribution Networks with Malicious Relay Nodes

Zarna Dinesh Solanki, Aayush Jain, Adwait A. Gondhalekar +3 more

Abstract Secure key distribution is crucial for maintaining communication confidentiality in networks with multiple communicating partners. Asymmetric key algorithms are vulnerable to quantum attacks because of the computational advantage offered by quantum computers, whereas symmetric key algorithms with sufficiently large keys remain comparatively more resistant. Quantum Key Distribution (QKD) has emerged as a promising quantum-secure key distribution technique based on the principles of quantum physics. However, practical QKD networks often rely on relay nodes to extend communication distance, and malicious relay nodes can compromise quantum keys during the relaying process. This study proposes a secure key relaying approach based on Shamir's Secret Sharing to mitigate this vulnerability. The proposed method uses a probabilistic behavioural model to assess relay nodes according to their curiosity and collaboration tendencies. By splitting a quantum key into multiple shares and routing them through paths with minimum compromise risk, the approach reduces exposure to malicious or colluding relay nodes. The proposed algorithm assigns risk to network paths by evaluating node-level curiosity and collaboration potential, determines the appropriate number of shares, and selects secure routing paths to minimise key compromise. The study further analyses the parameters influencing the ideal number of shares for a given network, thereby offering a resilient mechanism for quantum-safe communication in QKD networks with malicious relay nodes.

•Oct 15, 2026•0 citations
With the advent of powerful quantum computers, an emerging quantum-resilient security mechanism within existing networks is crucial. Thus, Quantum Key Distribution (QKD), which generates symmetric secret keys with Information-Theoretical Security (ITS) for secure point-to-point communication, is present as a solution. Despite QKD’s potential, its deployment is challenging due to significant investment and infrastructure requirements. Using state-of-the-art technology, the maximum distance between nodes is limited to hundreds of kilometers, necessitating multiple nodes to relay keys. For now, QKD Network (QKDN) relies on software-defined networking (SDN) and a central orchestrator, but this centralized approach has limitations. Hence, the main challenge is to select an efficient path between key relays to avoid communication failure. To address these challenges, a more distributed approach could be envisioned. In this paper, we propose to leverage one of the distributed routing protocols, OSPF, to redefine and improve the current architecture. We propose a novel QKDN-based OSPF (Open Shortest Path First) architecture for efficient key relay routing, offering a completely different dimension to the overall network management: we modify QKDN architecture to exploit the OSPF networks and present a QKD-enabled OSPF version capable of computing the best path for key relay, offering a cost-effective and scalable solution for widespread QKD adoption.
Recent developments in quantum key distribution (QKD) demonstrate the maturity of securing sensitive data against the emerging quantum computing threat. For QKD-secured long-haul and meshed optical transport networks (OTNs), quantum key management systems (QKMSs) are essential to overcome current distance limitations of available QKD devices. In this work, we present and compare two implementations of QKMSs, analyzing their scalability with an emulated QKD network (QKDN) utilizing recorded performance metrics from deployed QKD devices. First, we use a state-of-the-art Internet routing scheme, i.e., open shortest path first (OSPF), demonstrating that key management entities (KMEs) can solve the key routing problem utilizing distributed routing. Second, we apply software-defined networking (SDN) to implement centralized routing with a SDN controller. This paper compares distributed with centralized key routing regarding scalability, throughput, and latency. Both schemes facilitate up to six key relays between any pair of nodes in parallel with average key relay durations per hop below 300 ms given the Nobel-Germany topology and any-to-any demand matrix. With a network-wide joint key routing optimization in the SDN controller, up to 16.7% higher demands can be served compared to distributed key routing. Within the inherent compatibility of our study to network-function virtualization (NFV), we guideline future integration of QKMSs into deployed OTNs.
With the advent of quantum computing, the increasing threats to security poses a great challenge to communication networks. Recent innovations in this field resulted in promising technologies such as Quantum Key Distribution (QKD), which enables the generation of unconditionally secure keys, establishing secure communications between remote nodes. Additionally, QKD networks enable the interconnection of multi-node architectures, extending the point-to-point nature of QKD. However, due to the limitations of the current state of technology, the scalability of QKD networks remains a challenge toward feasible implementations. When it comes to long-distance implementations, trusted relay nodes partially solve the distance issue through the forwarding of the distributed keys, allowing applications that do not have a direct QKD link to securely share key material. Even though the relay procedure itself has been extensively studied, the establishment of the relaying node path still lacks a solution. This paper proposes an innovative network architecture that solves the challenges of Key Management System (KMS) identification, relay path discovery, and scalability of QKD networks by integrating Software-Defined Networking (SDN) principles, and establishing high-level virtual KMSs (vKMS) in each node and creating a new entity called the Quantum Security Controller (QuSeC). The vKMS serves the end-user key requests, managing the multiple KMSs within the node and abstracting the user from discovering the correct KMS. Additionally, based on the high-level view of the network topology and status, the QuSeC serves the path discovery requests from vKMSs, computing the end-to-end (E2E) relay path and applying security policies. The paper also provides a security analysis of the proposal, identifying the security levels of the architecture and analyzing the core networking security properties, and a performance evaluation that confirms the feasibility and scalability of the proposal.
This work addresses the orchestration of large-scale Quantum Key Distribution Networks (QKDNs) using Software Defined Networking (SDN). Building on ETSI and ITU specifications, common best practices and architectures are outlined. The main task of the SDN Controller is to aggregate technical key performance indicators (KPI) from the network and, based on these, select the optimal path. Multiple path selection algorithms, based on Dijkstra or a maximum-minimum capacity algorithm, with built-in load balancing are presented. The algorithms were tested in simulations and their performances, and tradeoffs, are discussed. Additional critical aspects related to SDN controlled QKDNs are discussed, such as query batching, multi-path selection and group key capabilities. An oblivious multi-party protocol is proposed for relay path selection in a multi-domain scenario, so providers don't have to disclose sensitive information about their QKDN. These contributions aim to enhance scalability, resilience and interoperability in quantum-secure network infrastructures.
Quantum Key Distribution (QKD) takes a short time to process encryption and authentication messages as an advanced security key distribution. Open Shortest Path First (OSPF) routing used on existing QKD networks uses more security keys. Software-Defined Networking (SDN) exists to control the core network, make routes easier to find and reduce the use of security keys. One of the benefits of SDN is that the controller can customize the routing scheme and save the use of secure keys. Based on the topology and scenarios, the link state protocol test results show that using keys increased the number of hops traversed by five to fourteen keys. We can see the five keys constant when testing the distance vector protocol. The average test time difference between the two protocols is about 3.438 seconds for the link state protocol and 2.687 seconds for the distance vector algorithm.
Quantum Key Distribution (QKD) has emerged as a promising technology for secure the communication because its security is achieved through the physical laws of quantum mechanics, rather than being based on mathematical problems. In most of the earlier implementations, QKD relied on the direct exchange of the secret keys between two users. Once implemented in a practical system outside of a controlled laboratory setting, QKD experiences complications associated with the limited distances, communication losses, and vulnerabilities to eavesdropping in the multi-user network configurations, compromising its ability to be this third-generation secure communication system. In this work, we show how quantum relay nodes can be implemented as points along a QKD network. The relay nodes provide additional advantages such as extending the communication distances, increasing eavesdropping resistance and allowing for more sophisticated configurations. While relying on theoretical models and experimentally motivated studies, this paper discusses advantages of implementing a relay architecture into a QKD network and highlights technical difficulties that need to be addressed prior to widespread implementation.
Abstract Secure key distribution is crucial for maintaining communication confidentiality in networks with multiple communicating partners. Asymmetric key algorithms are vulnerable to quantum attacks because of the computational advantage offered by quantum computers, whereas symmetric key algorithms with sufficiently large keys remain comparatively more resistant. Quantum Key Distribution (QKD) has emerged as a promising quantum-secure key distribution technique based on the principles of quantum physics. However, practical QKD networks often rely on relay nodes to extend communication distance, and malicious relay nodes can compromise quantum keys during the relaying process. This study proposes a secure key relaying approach based on Shamir's Secret Sharing to mitigate this vulnerability. The proposed method uses a probabilistic behavioural model to assess relay nodes according to their curiosity and collaboration tendencies. By splitting a quantum key into multiple shares and routing them through paths with minimum compromise risk, the approach reduces exposure to malicious or colluding relay nodes. The proposed algorithm assigns risk to network paths by evaluating node-level curiosity and collaboration potential, determines the appropriate number of shares, and selects secure routing paths to minimise key compromise. The study further analyses the parameters influencing the ideal number of shares for a given network, thereby offering a resilient mechanism for quantum-safe communication in QKD networks with malicious relay nodes.