Quantum-key-distribution (QKD) networks can provide absolutely secure keys for the entire communication system in theory. At present, the key-distribution rate is relatively low, and the key-distribution rate decreases exponentially as the distribution distance increases. The trusted-relay scheme commonly used in existing QKD networks achieves the purpose of extending the security distance by consuming additional keys. Since the channel is unreliable, the key-relay process will accumulate system errors to a certain extent, increasing the probability of key-relay failure. In some high-bit-error-rate network scenarios such as wireless networks and disaster environments, the channel-error rate is as high as 30–50%. And in these scenarios, there are usually a large number of confidential messages that need to be delivered. However, the key-management mechanism of the current QKD system does not consider the scenario of key-relay failure. If the key is not successfully relayed, all the keys participating in the relay process will be destroyed, including the key that has been successfully relayed before. This situation causes the key to be wasted and reduces the encryption capability of the system. In this paper, we proposed the quantum-key-recycling (QKR) mechanism to increase the number of keys available in the network and introduced a secure service grading mechanism to properly reuse the recycled keys. The QKR mechanism can be regarded as a key-management mechanism acting on the point-to-point QKD system, and the mechanism is designed for a classical channel to reuse the key resources. A post-processing method for recycled keys is proposed to improve the security of the keys. Simulation results show that the QKD network using the key-recycling strategy is about 20% higher in key-utilization rate than the traditional QKD network without the QKR mechanism, and about 10% higher in-service security coverage.
Quantum-key-distribution (QKD) networks can provide absolutely secure keys for the entire communication system in theory. At present, the key-distribution rate is relatively low, and the key-distribution rate decreases exponentially as the distribution distance increases. The trusted-relay scheme commonly used in existing QKD networks achieves the purpose of extending the security distance by consuming additional keys. Since the channel is unreliable, the key-relay process will accumulate system errors to a certain extent, increasing the probability of key-relay failure. In some high-bit-error-rate network scenarios such as wireless networks and disaster environments, the channel-error rate is as high as 30–50%. And in these scenarios, there are usually a large number of confidential messages that need to be delivered. However, the key-management mechanism of the current QKD system does not consider the scenario of key-relay failure. If the key is not successfully relayed, all the keys participating in the relay process will be destroyed, including the key that has been successfully relayed before. This situation causes the key to be wasted and reduces the encryption capability of the system. In this paper, we proposed the quantum-key-recycling (QKR) mechanism to increase the number of keys available in the network and introduced a secure service grading mechanism to properly reuse the recycled keys. The QKR mechanism can be regarded as a key-management mechanism acting on the point-to-point QKD system, and the mechanism is designed for a classical channel to reuse the key resources. A post-processing method for recycled keys is proposed to improve the security of the keys. Simulation results show that the QKD network using the key-recycling strategy is about 20% higher in key-utilization rate than the traditional QKD network without the QKR mechanism, and about 10% higher in-service security coverage.
Quantum key distribution (QKD) allows the distribution of secret keys for quantum-secure communication between two distant parties, vital in the quantum computing era in order to protect against quantum-enabled attackers. However, overcoming rate-distance limits in QKD and the establishment of quantum key distribution networks necessitate key relaying over trusted nodes. This process may be resource-intensive, consuming a substantial share of the scarce QKD key material to establish end-to-end secret keys. Hence, an efficient scheme for key relaying and the establishment of end-to-end key pools is essential for practical and extended quantum-secured networking. In this paper, we propose and compare two protocols for managing, storing, and distributing secret key material in QKD networks, addressing challenges such as the success rate of key requests, key consumption, and overhead resulting from relaying. We present an innovative, fully decentralized key distribution strategy as an alternative to the traditional hop-by-hop relaying via trusted nodes, where three experiments are considered to evaluate performance metrics under varying key demand. Our results show that the decentralized pre-flooding approach achieves higher success rates as application demands increase. This analysis highlights the strengths of each approach in enhancing QKD network performance, offering valuable insights for developing robust key distribution strategies in different scenarios.
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.
Quantum-key-distribution (QKD) networks can theoretically generate quantum secret keys that are completely secure for an entire communication system. The rate of key distribution is low and decreases exponentially with increasing distance. A classic trusted relay (CTR) uses additional keys to enhance security distance in QKD networks. In practice, the assurance of security for certain relay nodes is still lacking, despite the fact that CTR requires that all nodes be trusted. Owing to channel unreliability, system faults accumulate during the key relay, thereby increasing the probability of CTR failing to distribute the secret key. The failure of a successful key relay would then result in the subsequent destruction of all the keys involved in the process, which leads to the wasting of the quantum secret key and reduction system encryption. Accordingly, reducing the impact of CTR failures and realising the key security distribution of remote quantum networks have become new challenges that require the development of a new survivability scheme. In this study, a software-defined networking (SDN) technique is introduced to circumvent this drawback by utilising the flexibility provided by the SDN paradigm for better QKD network management efficiency. In particular, a novel survivability model called software-defined quantum key relay failure (SDQKRF) is proposed in this paper in which a new function is developed and added to the SDN controller. According to the simulation results, SDN over a QKD network using the SDQKRF model is more reliable and performs better in terms of the key generation ratio, key utilisation rate, recovery after failure, avalanche effect, and service blocking rate than a regular QKD network without the SDQTRF model.
Quantum key distribution (QKD) is a symmetric key exchange mechanism designed to enhance the security of current communication systems. Although QKD provides unconditional security, it also comes with deployment challenges. One challenge is the distance limitation between the transmitter and receiver, which restricts the large-scale adoption of QKD. To overcome this, trusted relays are used as intermediate nodes, allowing QKD to evolve from distance-limited point-to-point connections to unlimited QKD networks (QKDN). With an increasing deployment of QKD and a growing number of applications requesting keys, quality of service (QoS) constraints must be set for efficient key resource management to alleviate the risk of rejecting application requests. In this work, we integrate key delivery delay and maximum requested key size as QoS constraints in a novel key allocation algorithm built on three QKDN layers – quantum, key management and service. Moreover, we design key relaying using quantum key pools and virtual quantum key pools as storage mechanisms. We use static and dynamic weights for relay path computation and evaluate their impact on the proposed key allocation strategies with QoS constraints and find that static weights show a good overall performance for QKDN, while performance with dynamic weights varies based on historical key consumption data.
Secure communication makes the widespread use of telecommunication networks and services possible. With the constant progress of computing and mathematics, new cryptographic methods are being diligently developed. Quantum Key Distribution (QKD) is a promising technology that provides an Information-Theoretically Secure (ITS) solution to the secret-key agreement problem between two remote parties. QKD networks based on trusted relay nodes are built to provide service to a larger number of parties at arbitrary distances. They function as an add-on technology to traditional networks, generating, managing, distributing, and supplying ITS cryptographic keys. Since key resources are limited, integrating QKD network services into critical infrastructures necessitates effective key management. As a result, this article provides a comprehensive review of key management approaches for trusted-relay QKD networks. They are analyzed to facilitate the identification of potential strategies and accelerate the future development of QKD networks.
Quantum key distribution (QKD) is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols. However, due to the stringent requirements of the quantum key generation environment, the generated quantum keys are considered valuable, and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks. In this paper, for the QKD network with a trusted relay, which is mainly based on point-to-point quantum keys and has complex changes in network resources, we aim to allocate resources reasonably for data packet distribution. Firstly, we formulate a linear programming constraint model for the key resource allocation (KRA) problem based on the time-slot scheduling. Secondly, we propose a new scheduling scheme based on the graded key security requirements (GKSR) and a new micro-log key storage algorithm for effective storage and management of key resources. Finally, we propose a key resource consumption (KRC) routing optimization algorithm to properly allocate time slots, routes, and key resources. Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate, among others.