DDKA-QKDN: Dynamic On-Demand Key Allocation Scheme for Quantum Internet of Things Secured by QKD Network

Abstract

In the era of the interconnection of all things, the security of the Internet of Things (IoT) has become a new challenge. The theoretical basis of unconditional security can be guaranteed by using quantum keys, which can form a QKD network-based security protection system of quantum Internet of things (Q-IoT). However, due to the low generation rate of the quantum keys, the lack of a reasonable key allocation scheme can reduce the overall service quality. Therefore, this paper proposes a dynamic on-demand key allocation scheme, named DDKA-QKDN, to better meet the requirements of lightweight in the application scenario of Q-IoT and make efficient use of quantum key resources. Taking the two processes of the quantum key pool (QKP) key allocation and the QKP key supplement into account, the scheme dynamically allocates quantum keys and supplements the QKP on demand, which quantitatively weighs the quantum key quantity and security requirements of key requests in proportion. The simulation results show that the system efficiency and the ability of QKP to provide key request services are significantly improved by this scheme.

A new quantum key distribution resource allocation and routing optimization scheme

“…Yu et al [24] proposed a heuristic collaborative routing algorithm for partially trusted relay QKD networks, considering relay deployment and remaining key quantities, but with certain deficiencies in handling request disparities. Additionally, some routing schemes [25][26][27][28][29][30] prioritize subsequent processing requests based on criteria such as security levels, business variations, and request arrival times. These schemes can accommodate diverse domain requirements with relatively few restrictions concerning efficiency enhancement considerations.…”

A Resource-Adaptive Routing Scheme with Wavelength Conflicts in Quantum Key Distribution Optical Networks

“…Many different solutions are proposed to achieve resource allocation, including routing, wavelength, and quantum key methods. Table 1 compares focus points and performance metrics of the related works [33][34][35][36][37] with our scheme, where '-' means that this issue is not involved in the corresponding paper. Ref.…”

APR-QKDN: A Quantum Key Distribution Network Routing Scheme Based on Application Priority Ranking

“…Yu et al [ 23 ] proposed a heuristic collaborative routing algorithm for partially-trusted relay QKD networks, which integrates consideration of relay and residual keys, but it lacks sufficient consideration of the differences among requests. In addition, some routing schemes [ 24 , 25 , 26 , 27 ] set up different request priorities for subsequent processing based on criteria such as security level, business differences, and request arrival time. These schemes satisfy the demand differences of requests in diverse areas and have relatively little limitation in terms of efficiency improvement consideration.…”