Quantum Key Distribution (QKD) is a recent technology for secure distribution of symmetric keys, which is currently being deployed to increase communications security against quantum attacks. However, the key rate achievable over a weak quantum signal is limited by the link performance (e.g., loss and noise) and propagation distance, especially in multi-node QKD networks, making it necessary to design a scheme to efficiently and timely distribute keys to the various nodes. In this work, we formulate, using a Mixed Integer Linear Programming (MILP) model, a novel Routing, Channel, and Key-rate Assignment (RCKA) problem for QKD with Quantum Key Pool (QKP), which exploits the opportunity of using trusted relays and optical bypass. Our formulation accounts for the possibility to build a quantum key distribution path that combines both quantum channels and trusted relays to increase the acceptance ratio of key rate requests. Leveraging different versions of the proposed MILP model, we evaluate several strategies exploiting different combinations of trusted relays and optical bypass for the RCKA problem. Results show how different trade-offs between security and resource-efficiency (expressed in terms of acceptance ratio of key rate requests vs. key storing rate in QKP) can be achieved when adopting trusted-relay and/or optical-bypass technologies. Trusted relays can provide a higher acceptance ratio when the number of QKD modules (transmitters or receivers) is sufficiently large, while optical bypass, which does not require the implementation of expensive trusted relays, is preferable when the number of QKD modules is a limiting factor.

Joint Routing, Channel, and Key-Rate Assignment for Resource-Efficient QKD Networking

Zhang, Qiaolun;Ayoub, Omran;Gatto, Alberto;Musumeci, Francesco;Verticale, Giacomo;Tornatore, Massimo
2022-01-01

Abstract

Quantum Key Distribution (QKD) is a recent technology for secure distribution of symmetric keys, which is currently being deployed to increase communications security against quantum attacks. However, the key rate achievable over a weak quantum signal is limited by the link performance (e.g., loss and noise) and propagation distance, especially in multi-node QKD networks, making it necessary to design a scheme to efficiently and timely distribute keys to the various nodes. In this work, we formulate, using a Mixed Integer Linear Programming (MILP) model, a novel Routing, Channel, and Key-rate Assignment (RCKA) problem for QKD with Quantum Key Pool (QKP), which exploits the opportunity of using trusted relays and optical bypass. Our formulation accounts for the possibility to build a quantum key distribution path that combines both quantum channels and trusted relays to increase the acceptance ratio of key rate requests. Leveraging different versions of the proposed MILP model, we evaluate several strategies exploiting different combinations of trusted relays and optical bypass for the RCKA problem. Results show how different trade-offs between security and resource-efficiency (expressed in terms of acceptance ratio of key rate requests vs. key storing rate in QKP) can be achieved when adopting trusted-relay and/or optical-bypass technologies. Trusted relays can provide a higher acceptance ratio when the number of QKD modules (transmitters or receivers) is sufficiently large, while optical bypass, which does not require the implementation of expensive trusted relays, is preferable when the number of QKD modules is a limiting factor.
2022
GLOBECOM 2022 - 2022 IEEE Global Communications Conference
978-1-6654-3540-6
File in questo prodotto:
File Dimensione Formato  
Globecom_RCKA_final.pdf

accesso aperto

: Pre-Print (o Pre-Refereeing)
Dimensione 330.63 kB
Formato Adobe PDF
330.63 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1227580
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 0
social impact