Auxiliary Graph based QKD Key Provisioning for End-to-End Security Service in Optical Networks

Zhu, Qingcheng; Yu, Xiaosong; Zhao, Yongli; Nag, Avishek; Wang, Hua; Chen, Liquan; Zhang, Jie

doi:10.1364/ofc.2022.th3d.2

Cited by 2 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the cost of QKD deployment, Ref. [17] proposes solutions for key management in networks with partial QKD deployment. Different from previous work, in this paper we systematically compare different network settings exploiting trusted relays and/or optical bypass.…”

Section: Background and Related Workmentioning

confidence: 99%

“…After finding a shortest path for a key rate, Algorithm 2 assigns quantum channels and QKD modules and updates the amount of keys stored in the QKP (line [11][12]. Finally, if the keys stored in the QKP are equal to the capacity of the QKP, the algorithm stops storing keys for node pair p (line [15][16][17][18].…”

Section: General Resource-efficient Rckta Algorithmmentioning

confidence: 99%

“…Eqn (17). ensures that key request d is served if the sum of key rates for d in all quantum channels and time-slots is greater or equal to the required key rate r d during the time period to serve requests.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Routing, Channel, Key-Rate, and Time-Slot Assignment for QKD in Optical Networks

Zhang

Ayoub

Gatto

et al. 2024

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Quantum Key Distribution (QKD) is currently being explored as a solution to the threats posed to current cryptographic protocols by the evolution of quantum computers and algorithms. However, single-photon quantum signals used for QKD permit to achieve key rates strongly limited by link performance (e.g., loss and noise) and propagation distance, especially in multinode QKD networks, making it necessary to design a scheme to efficiently and timely distribute keys to the various nodes. In this work, we introduce the new problem of joint Routing, Channel, Key-rate and Time-slot Assignment (RCKTA), which is addressed with four different network settings, i.e., allowing or not the use of optical bypass (OB) and trusted relay (TR). We first prove the NP-hardness of the RCKTA problem for all network settings and formulate it using a Mixed Integer Linear Programming (MILP) model that combines both quantum channels and quantum key pool (QKP) to provide an optimized solution in terms of number of accepted key rate requests and key storing rate. To deal with problem complexity, we also propose a heuristic algorithm based on an auxiliary graph, and show that it is able to obtain nearoptimal solutions in polynomial time. Results show that allowing OB and TR achieves an acceptance ratio of 39% and 14% higher than that of OB and TR, respectively. Remarkably, these acceptance ratios are obtained with up to 46% less QKD modules (transceivers) compared to TR and only few (less than 1 per path) additional QKD modules than OB.

show abstract

Section: Background and Related Workmentioning

confidence: 99%