Dynamic-threshold-based pre-relaying for enhanced key allocation in quantum-secured networks

IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Catalina Stan;Dominique Verchere;Juan Jose Vegas Olmos;Idelfonso Tafur Monroy;Simon Rommel
{"title":"Dynamic-threshold-based pre-relaying for enhanced key allocation in quantum-secured networks","authors":"Catalina Stan;Dominique Verchere;Juan Jose Vegas Olmos;Idelfonso Tafur Monroy;Simon Rommel","doi":"10.1364/JOCN.544857","DOIUrl":null,"url":null,"abstract":"Quantum key distribution (QKD) is experiencing a rapid increase of interest due to its security advantages in the face of quantum computers. However, typical QKD deployments are point-to-point and limited in terms of distance, which significantly restricts their utilization for end-user applications. To overcome these restrictions, trusted relays are adopted as intermediate nodes to allow the transition to QKD networks (QKDNs), where one of the hallmarks is the key management system. In this work, we investigate different key allocation strategies as a method to enhance the performance of key management systems in QKDN from the perspective of key allocation success rate and key delivery delay. We first describe an upgrade model from classical to QKDN at three distinct network layers—quantum, key management, and service. Then, we propose a novel, to our knowledge, key allocation strategy leveraging the benefits of key storage and relaying as a solution to improve the QKDN performance. To achieve this, our method makes use of end-to-end virtual quantum key pools (VQKPs) implemented between non-adjacent nodes requesting key material. We introduce static and dynamic upper and lower threshold limits at the VQKP level, with the dynamic thresholds adapted according to application demand, to control the key distribution in the network and fill the pools ahead of end-user requests. We demonstrate through simulations that the introduction of thresholds achieves performance enhancement and explain the trade-off between the key allocation success rate and key delivery delay evaluation metrics in comparison with different on-demand key allocation strategies.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"17 3","pages":"233-248"},"PeriodicalIF":4.0000,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optical Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10908537/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Quantum key distribution (QKD) is experiencing a rapid increase of interest due to its security advantages in the face of quantum computers. However, typical QKD deployments are point-to-point and limited in terms of distance, which significantly restricts their utilization for end-user applications. To overcome these restrictions, trusted relays are adopted as intermediate nodes to allow the transition to QKD networks (QKDNs), where one of the hallmarks is the key management system. In this work, we investigate different key allocation strategies as a method to enhance the performance of key management systems in QKDN from the perspective of key allocation success rate and key delivery delay. We first describe an upgrade model from classical to QKDN at three distinct network layers—quantum, key management, and service. Then, we propose a novel, to our knowledge, key allocation strategy leveraging the benefits of key storage and relaying as a solution to improve the QKDN performance. To achieve this, our method makes use of end-to-end virtual quantum key pools (VQKPs) implemented between non-adjacent nodes requesting key material. We introduce static and dynamic upper and lower threshold limits at the VQKP level, with the dynamic thresholds adapted according to application demand, to control the key distribution in the network and fill the pools ahead of end-user requests. We demonstrate through simulations that the introduction of thresholds achieves performance enhancement and explain the trade-off between the key allocation success rate and key delivery delay evaluation metrics in comparison with different on-demand key allocation strategies.
量子安全网络中基于动态阈值的增强密钥分配预中继
面对量子计算机,量子密钥分发(QKD)由于其安全优势正迅速受到人们的关注。然而,典型的QKD部署是点对点的,并且距离有限,这极大地限制了它们在终端用户应用程序中的利用。为了克服这些限制,采用可信中继作为中间节点,以允许过渡到QKD网络(qkdn),其中的标志之一是密钥管理系统。在这项工作中,我们从密钥分配成功率和密钥交付延迟的角度研究了不同的密钥分配策略,作为提高QKDN中密钥管理系统性能的方法。我们首先描述了从经典到QKDN的三个不同网络层(量子、密钥管理和服务)的升级模型。然后,我们提出了一种新颖的,据我们所知,利用密钥存储和中继的好处作为改进QKDN性能的解决方案的密钥分配策略。为了实现这一点,我们的方法利用在请求密钥材料的非相邻节点之间实现的端到端虚拟量子密钥池(VQKPs)。我们在VQKP级别引入静态和动态上限和下限阈值限制,并根据应用程序需求调整动态阈值,以控制网络中的密钥分发,并在最终用户请求之前填充池。我们通过模拟证明,阈值的引入实现了性能增强,并解释了与不同的按需密钥分配策略相比,密钥分配成功率和密钥交付延迟评估指标之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
9.40
自引率
16.00%
发文量
104
审稿时长
4 months
期刊介绍: The scope of the Journal includes advances in the state-of-the-art of optical networking science, technology, and engineering. Both theoretical contributions (including new techniques, concepts, analyses, and economic studies) and practical contributions (including optical networking experiments, prototypes, and new applications) are encouraged. Subareas of interest include the architecture and design of optical networks, optical network survivability and security, software-defined optical networking, elastic optical networks, data and control plane advances, network management related innovation, and optical access networks. Enabling technologies and their applications are suitable topics only if the results are shown to directly impact optical networking beyond simple point-to-point networks.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信