International Conference on Advanced Intelligence and Awareness Internet (AIAI)

A QoS-supported scheme for quantum key distribution

Xianzhu Cheng, Yongmei Sun, Yuefeng Ji

Published Jan 1, 2011• 15 citations

Abstract

As a technology of providing different service qualities to the different applications/users, QoS is a research hotspot in communication field. For quantum key distribution (QKD) networks which provide unconditional security for distribution of cryptographic keys, its unique characteristics, like extreme quantum key resource constraint and the different time requirements of secure key distribution, pose unprecedented challenges for the QoS support in QKD networks. In this paper, a service model is presented firstly, which includes three service classes with different distribution time requirements: key-guaranteed service, key-prioritized service and key-best-effort service. Then, a QoS-supported scheme is proposed to support this service model. Particularly, Quantum Key Reservation Approach (QKRA) is designed to reserve quantum keys for the key-guaranteed service. The simulation is conducted to investigate the performance of this QoS-supported scheme.

DOI: 10.1049/cp.2011.1461

Related papers

An On-demand Routing Scheme with QoS Provisioning for QKD Networks

Yuqi Yang, Zhonghui Li, Jian Li +4 more

As an emerging technology, Quantum Key Distribution (QKD) can provide information-theoretically secure keys for cryptographic purposes and it attracts worldwide attention. To extend its service capabilities from point-to-point communication to arbitrary remote communication parties, large-scale QKD network construction is underway. However, the dynamic and limited available resources of QKD networks remain a major obstacle to routing design. Numerous studies aim at designing routing schemes to maximize the overall network performance. While these routing schemes efficiently support end-to-end key relaying, their effectiveness diminishes when addressing diverse Quality of Service (QoS) requirements. In this paper, we propose an on-demand routing scheme with QoS provisioning to enhance end-to-end key relaying rates. Our scheme operates in two phases: an on-demand resource probing phase to dynamically update global network resource information and a routing decision phase that leverages a maximum flow model to optimize key relaying while satisfying rate-demand constraints. Simulation results on the SimQN platform demonstrate that the proposed scheme significantly improves end-to-end key relaying through-put and delay, providing effective QoS support for rate-demand QKD applications.

International Conference on Quantum Communications, Networking, and Computing (QCNC)Mar 31, 20251 citation

Resource Allocation Strategies in Quantum Key Distribution Networks

Catalina Stan, Dominique Verchère, Juan José Vegas Olmos +2 more

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.

GlobecomDec 8, 20242 citations

Using Quantum Key Distribution for Securing Real-Time Applications

Miralem Mehić

Quantum Key Distribution (QKD), based on the laws of physics rather than the computational \ncomplexity of mathematical problems, provides a secure way of establishing symmetrical binary \nkeys between two geographically distant users. The keys are secure from eavesdropping during \ntransmission and QKD ensures that any third party’s knowledge of the key is reduced to a \nminimum. In recent years, a noticeable progress in the development of quantum equipment has \nbeen reflected through a number of successful demonstrations of QKD technology. While they \nshow the great achievements of QKD, many practical difficulties still need to be resolved, such as \nto provide better service differentiation. These networks are characterized as being multihop in \nnature where the consumption key rate is often higher than the charging key rate, which means that \nthe links are available for a limited period of time only. Such features impose several challenges \non the effective modeling and evaluation of reliability as well as finding appropriate Quality \nof Service (QoS) solution. This thesis focuses on research in the field of QKD for securing \nreal-time communication by supporting QoS in QKD networks including a novel QoS model \nand novel distributed reactive routing protocol to achieve high-level scalability and minimize the \nconsumption of key material used for securing routing data. \nAs research in QKD networks grows larger and more complex, the need for highly accurate and \nscalable simulation technologies becomes important to assess the practical feasibility and foresee \ndifficulties in the practical implementation of theoretical achievements. Due to the specificity of \nQKD link which requires optical/quantum and Internet connection between the network nodes, it \nis very costly to deploy a complete testbed containing multiple network hosts and links to validate \nand verify a certain network algorithm or protocol. The network simulators in these circumstances \nsave a lot of money and time in accomplishing such task. A simulation environment offers the \ncreation of complex network topologies, a high degree of control and repeatable experiments, \nwhich in turn allows researchers to conduct exactly the same experiments and confirm their results. \nThis thesis describes the design and implementation of QKD network simulation module which \nwas developed in the network simulator of version 3 (NS-3). The module supports simulation \nof QKD network in overlay mode or in a single TCP/IP mode. Therefore, it can be used for \nsimulation of other network technologies regardless of QKD. \nImplemented simulation model was used for verification of proposed QoS solution. A number \nof simulations were performed. The obtained data have confirmed the primary thesis of this study, \nthat it is possible to use real-time applications in QKD networks.

Jan 1, 20170 citations

A Service-Differentiated Routing Scheme for Hybrid-Trusted Quantum Key Distribution Network

Qingzhu Han, Liquan CHEN, Jingqi Chen +2 more

Hybrid-trusted Quantum Key Distribution (QKD) networks face unique security challenges due to semi-trusted nodes. These nodes may introduce security threats such as man-in-the-middle attacks and key storage side-channel leakage. With the increasing complexity of QKD network architectures and expanding application scenarios, substantial divergences have emerged between user requirements for communication duration and cryptographic security demands. To address security challenges in hybrid-trusted QKD environments and provide differentiated services for users with varying requirements, this paper proposes a Service Requirement-based Hybrid-Trusted QKD Network (SRHT-QKDN) routing scheme. We propose a time-slot allocation model for QKD that employs time-slot resources as substitutes for key-generation resources in resource allocation processes. For sustained key distribution required by prolonged communications, the scheme implements two distinct time slot allocation algorithms: continuous-consistent and discrete-inconsistent allocation, enabling periodic quantum key updates. Concurrently, QKD requests are classified into three security levels, with corresponding routing strategies developed for each tier to achieve security service differentiation while maintaining routing success rates. Simulations conducted under four distinct operational conditions demonstrate that the SRHT-QKDN routing scheme not only effectively fulfills key continuity requirements but also achieves optimal overall performance in request success rate and security assurance, outperforming two benchmark routing schemes.

International Conference on IoT Based Control Networks and Intelligent Systems (ICICNIS)Dec 15, 20251 citation

Protection Schemes for Key Service in Optical Networks Secured by Quantum Key Distribution (QKD)

Hua Wang, Yongli Zhao, Xiaosong Yu +5 more

Quantum key distribution (QKD) is considered a secure solution for key distribution and applied in optical networks to overcome security issues by providing key services in different lightpaths. In optical networks, lightpaths in fibers can be used for the delivery of QKD due to their good transmission performance. Accordingly, optical networks secured by QKD have been regarded as an important paradigm, and survivability in this paradigm is an issue worthy of study. In this paper, we focus on the protection schemes for key services in optical networks secured by QKD. Specifically, in consistency with two characteristics of key services (i.e., the key-updating process and key-volume adaptive routing), two key-volume adaptive protection schemes (i.e., dedicated protection and shared protection) are proposed for the networks against link failures. In such scenarios, the designed key-protection threshold can alleviate the tight network resources caused by the key-updating process. Simulation work has been conducted to evaluate the performance of the proposed schemes in terms of blocking probability, resource utilization, and proportion of secret-key consumption with different key-protection thresholds and update periods. Numerical results show that the two proposed schemes are effective in providing protection. Furthermore, evaluating the impact of protection on network security verifies a trade-off that exists between how much protection can be provided for key services versus the overall security of the network, given a certain resource budget.

Journal of Optical Communications and NetworkingFeb 6, 201946 citations

A Distributed Routing Protocol Based on Key Reservation in Quantum Key Distribution Networks

Jiaqi Wu, Lutong Chen, Jing Zhang +5 more

Nowadays, Quantum Key Distribution (QKD) has garnered widespread attention due to its ability to provide symmetric secret keys with information-theoretic security in point-to-point communication. Additionally, key relay technology has been introduced to complete end-to-end key distribution between remote parties by consuming keys in the intermediate links. The routing problem of selecting paths for key relay technology becomes crucial as it directly impacts the network's performance. In this paper, we focus on addressing the routing problem for a specific scenario to serve applications with real-time requirements. Real-time is a critical necessity for supporting various applications, such as video chatting and calling. To satisfy real-time requirements and achieve Quality of Service (QoS) provision to guarantee the completion time, we introduce a distributed routing protocol called Distributed Routing Protocol Based on Key Reservation (Q-RoKR). It reserves keys in advance along the selected path, thereby satisfying real-time requirements. We also propose a priority-awareness mechanism to address resource competition and make efficient use of keys in links. Extensive experiments demonstrate that our protocol effectively meets the real-time requirements and significantly improves throughput. Furthermore, our key efficiency approaches the optimal bound when compared to other comparison schemes.

International Conference on CommunicationsJun 9, 20243 citations