Most of the existing metropolitan quantum networks are implemented based on a single quantum key distribution protocol, and interconnecting metropolitan quantum networks implemented by different protocols are the development trend of large-scale quantum networks, but there are still some problems in the provision of inter-domain key services, such as low possibility of success and mismatch between key supply and demand. To solve the above problems, this paper proposes two on-demand inter-domain key service provisioning strategies for multi-domain cross-protocol quantum networks, namely, on-demand provisioning strategy based on BB84 bypass first (BB84-BF) and on-demand provisioning strategy based on MDI bypass first (MDI-BF). Meanwhile, a service provisioning model for multi-domain cross-protocol quantum networks is constructed, and an on-demand inter-domain key service provisioning algorithm is designed. Moreover, numerical simulations and performance evaluation are carried out under two scenarios: high key rate demand and low key rate demand for two-domain and three-domain quantum network topologies. Simulation results verify that the proposed on-demand provisioning strategies have better applicability to different multi-domain quantum networks. In addition, for different key rate requirements, the MDI-BF strategy and BB84-BF strategys have different performance advantages under different performance indicators. For example, in terms of the success possibility of inter-domain key service requests, the MDI-BF strategy is more suitable for the low key rate requirements (~30% higher than the traditional strategies in two domain topologies), while the BB84-BF strategy is more suitable for the high key rate requirements (~19% higher than the traditional strategies under two domain topologies). In addition, compared with the traditional strategies, the proposed on-demand provisioning strategies can increase the balance degree between key supply and demand by more than one order of magnitude. Hence, the proposed strategies can reduce the cost of inter-domain key service provisioning and improve the realistic security level.
Most of the existing metropolitan quantum networks are implemented based on a single quantum key distribution protocol, and interconnecting metropolitan quantum networks implemented by different protocols are the development trend of large-scale quantum networks, but there are still some problems in the provision of inter-domain key services, such as low possibility of success and mismatch between key supply and demand. To solve the above problems, this paper proposes two on-demand inter-domain key service provisioning strategies for multi-domain cross-protocol quantum networks, namely, on-demand provisioning strategy based on BB84 bypass first (BB84-BF) and on-demand provisioning strategy based on MDI bypass first (MDI-BF). Meanwhile, a service provisioning model for multi-domain cross-protocol quantum networks is constructed, and an on-demand inter-domain key service provisioning algorithm is designed. Moreover, numerical simulations and performance evaluation are carried out under two scenarios: high key rate demand and low key rate demand for two-domain and three-domain quantum network topologies. Simulation results verify that the proposed on-demand provisioning strategies have better applicability to different multi-domain quantum networks. In addition, for different key rate requirements, the MDI-BF strategy and BB84-BF strategys have different performance advantages under different performance indicators. For example, in terms of the success possibility of inter-domain key service requests, the MDI-BF strategy is more suitable for the low key rate requirements (~30% higher than the traditional strategies in two domain topologies), while the BB84-BF strategy is more suitable for the high key rate requirements (~19% higher than the traditional strategies under two domain topologies). In addition, compared with the traditional strategies, the proposed on-demand provisioning strategies can increase the balance degree between key supply and demand by more than one order of magnitude. Hence, the proposed strategies can reduce the cost of inter-domain key service provisioning and improve the realistic security level.
Quantum key distribution (QKD), as one of the pivotal technologies for future-proof security, is progressing toward large-scale networking. Since different QKD protocols have their own potential advantages and shortcomings, the interconnection of metropolitan quantum networks based on heterogeneous protocols is an important step to realize a wide-area quantum network. In this scenario, the provision of inter-domain key services still faces challenges in terms of success probability, security level, and the balance between key supply and demand. Targeting these challenges, this work proposes four secret key rate (SKR) adaptive inter-domain key service provisioning policies based on the dynamic node bypass and elastic SKR slicing, namely, IrB-IaB (inter-domain bypass and intra-domain bypass), IrS-IaS (inter-domain slicing and intra-domain slicing), IrB-IaS (inter-domain bypass and intra-domain slicing), and IrS-IaB (inter-domain slicing and intra-domain bypass). The proposed policies are applicable to multi-domain quantum networks with heterogeneous protocols such as GG02-based metropolitan and BB84-based inter-domain connections, as well as BB84-based metropolitan and TF-based inter-domain connections. Furthermore, the inter-domain key service provisioning model is formulated, and four corresponding SKR-adaptive inter-domain key service provisioning algorithms are designed. Simulation results show that the IrS-IaS algorithm performs better in terms of success probability as well as the equilibrium degree between key supply and demand. The security level is quantitatively evaluated through the number of trusted relays. The IrB-IaB algorithm achieves the lowest number of trusted relays, which is more than 20% lower than the benchmark algorithm, resulting in a higher security level and lower cost. The key resource utilization efficiency is assessed via the equilibrium degree. Both the IrB-IaS and IrS-IaB algorithms have the potential to balance the effectiveness and reliability of quantum networks. In particular, the IrS-IaB algorithm is beneficial in achieving the best trade-off between key resource utilization efficiency and security level.
Abstract As the cornerstone of future information security, quantum key distribution (QKD) is evolving towards large-scale hybrid discrete-variable/continuous-variable (DV/CV) multi-domain quantum networks. Meanwhile, multicast-oriented multi-party key negotiation is attracting increasing attention in quantum networks. However, the efficient key provision for multicast services over hybrid DV/CV multi-domain quantum networks remains challenging, due to the limited probability of service success and the inefficient utilization of key resources. Targeting these challenges, this study proposes two key-resource-aware multicast-oriented key provision strategies, namely the link distance-resource balanced key provision strategy and the maximum shared link key provision strategy. The proposed strategies are applicable to hybrid DV/CV multi-domain quantum networks, which are typically implemented by GG02-based intra-domain connections and BB84-based inter-domain connections. Furthermore, the multicast-oriented key provision model is formulated, based on which two heuristic algorithms are designed, i.e., the shared link distance-resource (SLDR) dependent and the maximum shared link distance-resource (MSLDR) dependent multicast-oriented key provision algorithms. Simulation results verify the applicability of the designed algorithms across different multi-domain quantum networks, and demonstrate their superiority over the benchmark algorithms in terms of the success probability of multicast service requests, the number of shared links, and the key resource utilization.
Quantum key distribution (QKD) has potential to provide long-term security for communications across the Internet. As security-hungry applications dramatically rise nowadays, a growing number of QKD networks are promising to be deployed in the immediate future. Nevertheless, a high-security-demand institution (e.g., a bank) needs to pay a high price to deploy its dedicated QKD network, while a cost-effective way of overcoming this challenge is to make multiple tenants share a QKD network. Each tenant represents a high-security-demand institution and can obtain secret keys on demand from the QKD network infrastructure for security purposes. Hence, how to achieve efficient and flexible multi-tenant provisioning over a QKD network becomes a crucial problem. This work introduces software defined networking (SDN) to address this problem. We experimentally demonstrate multi-tenant provisioning (including tenant establishment, adjustment, and deletion) over SDN-enabled metropolitan area QKD networks. A SDN-enabled metropolitan area QKD network architecture is introduced. We present a workflow, protocol extensions, and an on-demand secret-key resource allocation strategy for multi-tenant provisioning, which are all demonstrated by establishing an experimental testbed in the lab. Experimental results verify the effectiveness and flexibility of our SDN-based approaches for multi-tenant provisioning over metropolitan area QKD networks. Moreover, we conduct the simulation and discover the ways of improving the success probability of multi-tenant provisioning over metropolitan area QKD networks.
Quantum Key Distribution (QKD) networks are proposed as a solution to ensure information-theoretic security for symmetric key exchange in post-quantum networks. Key generation is limited and variable, hence Quantum Key Pools (QKPs) have been proposed to allow applications a quicker access to quantum keys for secure data exchange. Nevertheless, On-Demand (OD) key relaying can still entail a delay too large for some applications. Therefore, the concept of key provisioning has been proposed to expedite key supply whenever necessary, resulting in Virtual QKPs for non-adjacent QKD nodes. After the implementation of a key pre-provisioning strategy inspired by an approach proposed by other authors, some novel variants are proposed that aim to decrease demand blocking due to the lack of keys, without significantly increasing the delay for key supply. In this work, an experimental study is conducted, where different settings are considered for the simulation parameters (including the QKP capacity). We conclude that the different pre-provisioning strategies allow for a reduction in the blocking probability (calculated for demands and for data) and in the delay, when compared to an OD strategy.
Quantum key distribution (QKD) can provide long-term security for numerous users. Currently, quantum networks are still in the early stages of small-scale deployment, most of which can only support a single QKD protocol (QKDP). However, with the advancement of various QKDPs, a single-protocol quantum network is no longer sufficient to meet the demands of multiple users, prompting the emergence of multi-protocol quantum networks. Nevertheless, the transition from a single-protocol to a multi-protocol quantum network still faces many challenging issues, such as key negotiation interruptions due to device initialization and channel calibration during protocol updating. To address the quantum key negotiation interruption problem, we propose a seamless key negotiation oriented multi-protocol updating algorithm in this work, which can fulfill the protocol updating requests of different users in quantum metropolitan networks. Furthermore, to better improve network performance while meeting diverse user demands, we propose four heuristic algorithms for optimal QKDP recommendation, focusing on their applications for multi-protocol updating in different types of typical networks. We perform the simulations with different QKDP recommendation algorithms to analyze the impact of the cache time of the key cache area on the key negotiation interruption probability and the time resource utilization. Simulation results demonstrate that the proposed algorithm can reduce the key negotiation interruption probability by 77.7% while increasing the time resource utilization by 15.3% compared to no key cache area.
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.