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

China Communications

Quantum key distribution network: Optimal secret-key-aware routing method for trust relaying

Chao Yang, Hongqi Zhang, SU Jin-hai

Published Feb 1, 2018• 33 citations
Publisher

Abstract

Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.

DOI
10.1109/cc.2018.8300270

Related papers

The QKD network: model and routing scheme

Chao Yang, Hongqi Zhang, SU Jin-hai

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn’t address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

Journal of Modern Optics•Aug 11, 2017•48 citations

A Load Balancing Routing Algorithm for Quantum Key Distribution Networks

Xinghai Guo, Yuchen Zhou, Sijiang Xie +1 more

With the development of quantum computing and computer science, the risk of traditional cryptographic algorithms being cracked is increasing. Therefore, quantum key distribution (QKD) technology based on quantum physical properties has been developed to ensure the security of information communication. Large-scale QKD networks can be built using trusted relay technology, but the hops encryption and decryption process of trusted relay will consume extra keys, which makes it particularly important to choose a reasonable path to reduce the consumption of extra keys during key distribution. The existing routing algorithms mainly focus on the number of remaining keys and hops, but ignore the congestion information of the network, resulting in a high key exchange failure rate and an increase in key consumption. In view of this background, we propose a load balancing routing (LBR) algorithm, which can realize congestion control in QKD network by dynamically detecting link state with SDN controller. Simulation results show that LBR improves key request success rate by more than 10% and key utilization efficiency by about 5% compared with existing methods.

International Conference on Intelligent Systems, Communications and Computer Networks (ISCCN)•Feb 21, 2025•3 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

Hybrid Trusted Quantum Key Distribution Network Routing Scheme for Power Grid Environment

Jin Qian, Luo Jun, Jingqi Chen

With the continuous development of quantum computing technology, Quantum Key Distribution (QKD) is an important means of secure communication in the post-quantum era. However, the high cost of trusted routing relays in QKD networks has hindered its widespread adoption in power systems. Reducing costs is the key to the popularization of QKD in large-scale data grid scenarios. Therefore, this paper proposes a routing scheme for QKD network in a hybrid trusted environment. Our scheme is based on SDN architecture, utilizing the characteristics of QKD network in hybrid trusted environment, through prioritizing the selection of trusted paths (composed entirely of trusted quantum nodes) and backup selection of hybrid trusted paths (composed of both trusted and semi-trusted quantum nodes), implementing a unified dynamic routing strategy to obtain the optimal quantum routing path. Furthermore, by collecting topology information and real-time link status of the power grid, a calculation method for the number of paths and link costs is proposed to maximize load balancing in the network. Finally, the simulation results demonstrate that our scheme outperforms routing schemes relying solely on trusted quantum nodes for key distribution, as well as other cooperative routing schemes involving semi-trusted quantum nodes, in terms of success rate of distribution and load balancing.

IEEE International Conference on Computer and Communications (ICCC)•Dec 13, 2024•1 citation

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

Secret-Key Provisioning With Collaborative Routing in Partially-Trusted-Relay-based Quantum-Key-Distribution-Secured Optical Networks

Xiaosong Yu, Yuhang Liu, Xingyu Zou +4 more

Quantum Key Distribution (QKD) is a promising technology that provides proven unconditional security based on fundamentals of quantum physics, especially for point-to-point communications. It could be applied in large-scale optical networks for long-distance key provisioning mainly by three relaying methods: quantum-repeater-based QKD, trusted-relay-based QKD, and measurement-device-independent QKD (MDI-QKD). However, quantum-repeater-based QKD is still under study because of the immature technologies such as the preliminary quantum memory. The trusted-relay-based QKD is vulnerable since insecurity of non-ideal single-photon sources and detectors cannot be ignored in practical applications. On the other hand, for MDI-QKD, there exists a limitation on its key rate under long-distance communications. According to these limitations, embedding protocols like MDI-QKD into the existing trusted-relay-based QKD secured optical networks (QKD-ON) with usage of untrusted relays is a promising key-provisioning scheme. In this paper, we study such partially-trusted relay scenarios and focus on its routing of keys in different kinds of typical network topologies. A partially-trusted-relay-based QKD method is described, which can allow a pair of optical nodes sharing secret keys under the coexistence of trusted relays and untrusted relays. The secret-key provisioning with collaborative routing (SKP-CR) algorithm is proposed to search for the optimal key-relay routing path. We perform the simulations with different proportion of trusted relays versus untrusted relays, initial secret keys in the quantum key pools (QKPs), and traffic load. The simulations verify that theSKP-CRalgorithm can significantly outperform the conventional trusted-relay-based scheme in terms of key-distribution success rate with an improvement of up to62%with a mesh topology.

Journal of Lightwave Technology•Feb 24, 2022•89 citations
Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.
Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn’t address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.
With the development of quantum computing and computer science, the risk of traditional cryptographic algorithms being cracked is increasing. Therefore, quantum key distribution (QKD) technology based on quantum physical properties has been developed to ensure the security of information communication. Large-scale QKD networks can be built using trusted relay technology, but the hops encryption and decryption process of trusted relay will consume extra keys, which makes it particularly important to choose a reasonable path to reduce the consumption of extra keys during key distribution. The existing routing algorithms mainly focus on the number of remaining keys and hops, but ignore the congestion information of the network, resulting in a high key exchange failure rate and an increase in key consumption. In view of this background, we propose a load balancing routing (LBR) algorithm, which can realize congestion control in QKD network by dynamically detecting link state with SDN controller. Simulation results show that LBR improves key request success rate by more than 10% and key utilization efficiency by about 5% compared with existing methods.
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.
With the continuous development of quantum computing technology, Quantum Key Distribution (QKD) is an important means of secure communication in the post-quantum era. However, the high cost of trusted routing relays in QKD networks has hindered its widespread adoption in power systems. Reducing costs is the key to the popularization of QKD in large-scale data grid scenarios. Therefore, this paper proposes a routing scheme for QKD network in a hybrid trusted environment. Our scheme is based on SDN architecture, utilizing the characteristics of QKD network in hybrid trusted environment, through prioritizing the selection of trusted paths (composed entirely of trusted quantum nodes) and backup selection of hybrid trusted paths (composed of both trusted and semi-trusted quantum nodes), implementing a unified dynamic routing strategy to obtain the optimal quantum routing path. Furthermore, by collecting topology information and real-time link status of the power grid, a calculation method for the number of paths and link costs is proposed to maximize load balancing in the network. Finally, the simulation results demonstrate that our scheme outperforms routing schemes relying solely on trusted quantum nodes for key distribution, as well as other cooperative routing schemes involving semi-trusted quantum nodes, in terms of success rate of distribution and load balancing.
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.
Quantum Key Distribution (QKD) is a promising technology that provides proven unconditional security based on fundamentals of quantum physics, especially for point-to-point communications. It could be applied in large-scale optical networks for long-distance key provisioning mainly by three relaying methods: quantum-repeater-based QKD, trusted-relay-based QKD, and measurement-device-independent QKD (MDI-QKD). However, quantum-repeater-based QKD is still under study because of the immature technologies such as the preliminary quantum memory. The trusted-relay-based QKD is vulnerable since insecurity of non-ideal single-photon sources and detectors cannot be ignored in practical applications. On the other hand, for MDI-QKD, there exists a limitation on its key rate under long-distance communications. According to these limitations, embedding protocols like MDI-QKD into the existing trusted-relay-based QKD secured optical networks (QKD-ON) with usage of untrusted relays is a promising key-provisioning scheme. In this paper, we study such partially-trusted relay scenarios and focus on its routing of keys in different kinds of typical network topologies. A partially-trusted-relay-based QKD method is described, which can allow a pair of optical nodes sharing secret keys under the coexistence of trusted relays and untrusted relays. The secret-key provisioning with collaborative routing (SKP-CR) algorithm is proposed to search for the optimal key-relay routing path. We perform the simulations with different proportion of trusted relays versus untrusted relays, initial secret keys in the quantum key pools (QKPs), and traffic load. The simulations verify that theSKP-CRalgorithm can significantly outperform the conventional trusted-relay-based scheme in terms of key-distribution success rate with an improvement of up to62%with a mesh topology.