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

Communications in computer and information science

Quantum Key Distribution Strategy for Power Quantum Communication Networks Based on Trusted Relay Nodes

Donghai Huang, Xingnan Li, Jiajia Fu, Wenjuan Liang, Zhongmiao Kang

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-96-7188-5_12

Related papers

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

Modern Trends in Quantum Key Distribution Networks

Miralem Mehić, Stefan Raß, Peppino Fazio +1 more

Springer eBooks•Jan 1, 2022•6 citations

Quantum key distribution networks and their applications for blockchain-based technologies

Aleksey K. Fedorov

Journal of Lasers Optics & Photonics•Nov 10, 2017•0 citations

Quantum key distribution in partially-trusted QKD ring networks

Xinyi Lin, Gonghua Hou, Wei Lin +1 more

The long-distance transmission of quantum secret key is a challenge for quantum communication. As far as the current relay technology is concerned, the trusted relay technology is a more practical scheme. However, the trusted relay technology requires every relay node to be trusted, but in practical applications, the security of some relay nodes cannot be guaranteed. How to overcome the security problem of trusted relay technology and realize the security key distribution of remote quantum network has become a new problem. Therefore, in this paper, a method of quantum key distribution in ring network is proposed under the condition of the coexistence of trusted and untrusted repeaters, and proposes a partially-trusted based routing algorithm (PT-RA). This scheme effectively solves the security problem of key distribution in ring backbone network. And simulation results show that PT-RA can significantly improve key distribution success rate compared with the original trusted relay technology.

IEEE International Conference on Information Systems and Computer Aided Education (ICISCAE)•Sep 27, 2020•9 citations

Quantum Key Distribution Over Multi-point Communication System: An Overview

Ahmed Farouk, Omar Husain Tarawneh, Mohamed Elhoseny +4 more

Studies in big data•Oct 13, 2017•1 citation

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
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.
The long-distance transmission of quantum secret key is a challenge for quantum communication. As far as the current relay technology is concerned, the trusted relay technology is a more practical scheme. However, the trusted relay technology requires every relay node to be trusted, but in practical applications, the security of some relay nodes cannot be guaranteed. How to overcome the security problem of trusted relay technology and realize the security key distribution of remote quantum network has become a new problem. Therefore, in this paper, a method of quantum key distribution in ring network is proposed under the condition of the coexistence of trusted and untrusted repeaters, and proposes a partially-trusted based routing algorithm (PT-RA). This scheme effectively solves the security problem of key distribution in ring backbone network. And simulation results show that PT-RA can significantly improve key distribution success rate compared with the original trusted relay technology.
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.