ABSTRACT. Quantum key distribution (QKD) network develops rapidly in recent years. In order to improve the efficiency and security of quantum key distribution, this paper analyzes the advantages and disadvantages of single-path and multi-path quantum key distribution and proposes a multi-path quantum key distribution scheme. This scheme includes two aspects which are path equalization priority strategy and the No-public nodes strategy. The priority of the chosen path is based on the path bandwidth utilization, the number of routing hops and quantum keys stored in the trusted nodes. The no-public nodes strategy selects multiple key distribution paths without public nodes. The scheme can reduce the risk of path blocking and the consumption of quantum keys, improve the efficiency and security of QKD. Finally, this scheme is analyzed and verified.
ABSTRACT. Quantum key distribution (QKD) network develops rapidly in recent years. In order to improve the efficiency and security of quantum key distribution, this paper analyzes the advantages and disadvantages of single-path and multi-path quantum key distribution and proposes a multi-path quantum key distribution scheme. This scheme includes two aspects which are path equalization priority strategy and the No-public nodes strategy. The priority of the chosen path is based on the path bandwidth utilization, the number of routing hops and quantum keys stored in the trusted nodes. The no-public nodes strategy selects multiple key distribution paths without public nodes. The scheme can reduce the risk of path blocking and the consumption of quantum keys, improve the efficiency and security of QKD. Finally, this scheme is analyzed and verified.
This paper establishes a probability model of multiple paths scheme of quantum key distribution with public nodes among a set of paths which are used to transmit the key between the source node and the destination node. Then in order to be used in universal net topologies, combining with the key routing in the QKD network, the algorithm of the multiple paths scheme of key distribution we propose includes two major aspects: one is an approach which can confirm the number and the distance of the selection of paths, and the other is the strategy of stochastic paths with labels that can decrease the number of public nodes and avoid the phenomenon that the old scheme may produce loops and often get the nodes apart from the destination node father than current nodes. Finally, the paper demonstrates the rationality of the probability model and strategies about the algorithm.
Quantum key distribution (QKD) provides information-theoretic security based on quantum mechanics, and as quantum key distribution becomes increasingly practical, questions of how to employ it effectively over largescale networks and large distances becomes increasingly important. In this work, we investigate the B92 entanglement based QKD protocol and a five-layer QKD network architecture consisting of trusted relay nodes. Previous research seldom focused on the ground routing mechanism of QKD networks in detail. Since no intersecting links are beneficial to reducing the key consumption rate and improving link security, combined with the core idea of reducing the number of link relay hops, we propose a minimum path cost multi-path routing algorithm for no intersecting links in quantum key distribution networks. By analyzing the security of the link, we effectively reduce the number of relay nodes and the number of relay links that pass through and give priority to the routing scheme with the minimum number of hops in the number of relay hops, which avoids the congestion and waste caused by the existence of interleaved multi-path in traditional multi-path routing. Meanwhile, the scheme effectively improves the quality of service index, avoids the generation and consumption of redundant keys, and reduces the waste of quantum key resources.
Quantum Key Distribution (QKD) provides unconditional peer-to-peer security based on the principles of quantum physics. By utilizing relay nodes, the security of QKD can be extended over longer distances. However, the introduction of relay nodes brings both security and communication success rates issues. To tackle those issues we propose an enhanced multi-path scheme. The key features of our proposal are as follows: 1. By taking the reliability of relay nodes as one of the algorithm inputs,making the scheme more suitable for partially trusted QKD (PTQKD) networks. 2. By using Multi-Segment Multi-Path approach increases the difficulty for attackers to obtain complete key information and improves the security of PTQKD. 3. The adaptive routing algorithm generates a sufficient number of diverse paths based on node contribution rate, key freshness, and reliability. We conducted a theoretical analysis of the algorithm,and simulation results on PTQKD demonstrate that our method outperforms traditional QKD methods in terms of security and transmission success rate. This advancement has the potential to enhance the adoption of QKD networks.
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.
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.