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 Optical Communications and Networks (ICOCN)

Noise Interference Impact Degree-Aware Routing in Quantum Key Distribution Networks

Minyu liu, Xiaosong Yu, Yuhang Liu, Yongli Zhao

Published Jul 26, 2024• 0 citations
Publisher

Abstract

We introduce a noise interference impact degree (NIID), which quantifies the extent to which noise interference affects the network layer. The results demonstrate the feasibility of our scheme in significantly reducing the service blocking rate.
DOI
10.1109/icocn63276.2024.10648386

Related papers

Multi-level Key Supply Capability Aware Routing Algorithm Under Noise Attack in Multi-Domain Quantum Key Distribution Network (QKDN)

Congying Zhang, Jingjing Liu, Xiaosong Yu +1 more

This paper proposed a multi-level key supply capability aware routing algorithm under noise attack in multi-domain quantum key distribution network. Simulation results demonstrated that it could achieve good performance in terms of service blocking rate.

International Conference on Optical Communications and Networks (ICOCN)•Jul 28, 2025•0 citations

Key Rate and Security Degree-Aware Schemes Based on Hybrid Relay in Quantum Key Distribution Optical Networks

Yuxuan Lu, Huijie Yang, Hong Chen +2 more

Two key rate and security degree-aware schemes based on hybrid relay for key services are proposed to improve the success ratio in quantum key distribution optical network. Simulation results show that the schemes perform well in terms of success ratio, key rate, and security degree.

Asia Communications and Photonics Conference•Nov 2, 2024•1 citation

Anti-Interference Performance Analysis and Optimization Strategy of Quantum Key Distribution Protocol in Noisy Environment

Lingping Tao, Abby Yurong Zhang

Quantum key distribution (QKD) technology, a secure communication method based on the fundamental principles of quantum mechanics, enables secure key sharing between two communication nodes. In theory, the unconditional security of the QKD protocol depends on ideal quantum devices, classical devices, and perfect random number generation. However, there are significant differences between the devices in the actual system and the ideal conditions, and QKD systems are inevitably affected by various noises that seriously affect the anti-interference performance and key generation efficiency of the system. In this article, the authors analyze the anti-interference performance of the QKD protocol in noisy environments and propose a QKD network routing algorithm based on trust relay. This algorithm effectively reduces the bit error rate during network transmission and improves the efficiency of key distribution by optimizing the selection strategy of relay nodes and key forwarding paths.

International Journal of Information Technologies and Systems Approach•May 31, 2025•1 citation

Multi-Criteria Routing for Cryptographic Key Exchange in QKD Networks: Survey, Taxonomy, and a Conceptual Optimization Framework

Ivan Cvitic, Dragan Perakovic, Armando Nolasco Pinto

Quantum Key Distribution (QKD) networks enable unconditionally secure key exchange using quantum mechanical principles. However, routing cryptographic keys across multi-hop quantum networks introduces challenges unique to quantum communication. This survey analyzes and classifies 26 routing strategies proposed between 2013 and 2024 for terrestrial, satellite, and hybrid QKD infrastructures. Dynamic, key-aware routing algorithms have been shown to reduce service rejection rates by 25-40% compared to static shortest-path methods by incorporating real-time key pool availability and link error rates. Multi-path strategies improve resilience against trusted-node compromise by distributing keys across disjoint routes, albeit with an increase in key consumption of 30-60%. SDN-based orchestration frameworks emerge as essential enablers of flexible, QoS-aware routing for hybrid networks integrating terrestrial fibers and intermittent satellite links. Critical research directions include reducing dependence on trusted nodes through quantum repeaters or post-quantum cryptography, developing standardized key management interfaces for interoperability, and adopting AI-driven predictive routing for adapting to fluctuating network states. This comprehensive synthesis of routing algorithms, performance trade-offs, and unresolved issues offers practical guidance for engineering secure, adaptable, and large-scale QKD networks capable of meeting real-world deployment demands.

quant-pharXiv:2511.15465•Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Nov 20, 2025•0 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•45 citations

Exploring Quantum Key Distribution Routing Algorithms

João Barreirinhas, Rita Girão‐Silva, Teresa Gomes +1 more

Quantum Key Distribution allows the exchange of symmetric keys with information-theoretic security between adjacent nodes. Key relay techniques in Quantum Key Distribution Networks (QKDNs) address the need for symmetric keys between nodes that are either too distant for establishing a quantum link or separated by intermediate nodes. The Secure Key Rate is limited, which triggers a need to use buffers (Quantum Key Pools) to store keys for later use. The secure key relay uses One-Time Pad, thus the number of links in the route impacts the number of keys used to deliver a pair of symmetric keys. The need for efficient routing algorithms in QKDNs has led to different routing algorithms. This work revisits some routing approaches that have been improved here. Results show that using asymmetrical link costs reduces blocking, a Long Short-Term Memory approach is enhanced by including cross-validation, and finally some strategies to reduce management traffic are proposed.

International Conference on the Design of Reliable Communication Networks (DRCN)•May 12, 2025•1 citation
Quantum key distribution (QKD) technology, a secure communication method based on the fundamental principles of quantum mechanics, enables secure key sharing between two communication nodes. In theory, the unconditional security of the QKD protocol depends on ideal quantum devices, classical devices, and perfect random number generation. However, there are significant differences between the devices in the actual system and the ideal conditions, and QKD systems are inevitably affected by various noises that seriously affect the anti-interference performance and key generation efficiency of the system. In this article, the authors analyze the anti-interference performance of the QKD protocol in noisy environments and propose a QKD network routing algorithm based on trust relay. This algorithm effectively reduces the bit error rate during network transmission and improves the efficiency of key distribution by optimizing the selection strategy of relay nodes and key forwarding paths.
Quantum Key Distribution (QKD) networks enable unconditionally secure key exchange using quantum mechanical principles. However, routing cryptographic keys across multi-hop quantum networks introduces challenges unique to quantum communication. This survey analyzes and classifies 26 routing strategies proposed between 2013 and 2024 for terrestrial, satellite, and hybrid QKD infrastructures. Dynamic, key-aware routing algorithms have been shown to reduce service rejection rates by 25-40% compared to static shortest-path methods by incorporating real-time key pool availability and link error rates. Multi-path strategies improve resilience against trusted-node compromise by distributing keys across disjoint routes, albeit with an increase in key consumption of 30-60%. SDN-based orchestration frameworks emerge as essential enablers of flexible, QoS-aware routing for hybrid networks integrating terrestrial fibers and intermittent satellite links. Critical research directions include reducing dependence on trusted nodes through quantum repeaters or post-quantum cryptography, developing standardized key management interfaces for interoperability, and adopting AI-driven predictive routing for adapting to fluctuating network states. This comprehensive synthesis of routing algorithms, performance trade-offs, and unresolved issues offers practical guidance for engineering secure, adaptable, and large-scale QKD networks capable of meeting real-world deployment demands.
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 allows the exchange of symmetric keys with information-theoretic security between adjacent nodes. Key relay techniques in Quantum Key Distribution Networks (QKDNs) address the need for symmetric keys between nodes that are either too distant for establishing a quantum link or separated by intermediate nodes. The Secure Key Rate is limited, which triggers a need to use buffers (Quantum Key Pools) to store keys for later use. The secure key relay uses One-Time Pad, thus the number of links in the route impacts the number of keys used to deliver a pair of symmetric keys. The need for efficient routing algorithms in QKDNs has led to different routing algorithms. This work revisits some routing approaches that have been improved here. Results show that using asymmetrical link costs reduces blocking, a Long Short-Term Memory approach is enhanced by including cross-validation, and finally some strategies to reduce management traffic are proposed.