Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.09144

QuIKS: Near-Zero Latency Key Supply with Adaptive Buffering for Resource-Efficient Quantum Key Distribution Networks

Yuxin Chen, Zite Xia, Jian Li, Kaiping Xue, Zhonghui Li, Lutong Chen, Ruidong Li

quant-phcs.NISubmitted Apr 10, 2026• Announced Apr 13, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum key distribution (QKD) networks provide information-theoretically secure keys for distant parties, emerging as a vital alternative to classical cryptography infrastructures threatened by quantum computing. In QKD networks, the immediacy of key supply service is crucial to the security and performance of applications, as their data must be encrypted before transmission. While key buffering can enable instant key supply services, existing schemes rely on heuristic solutions that incur prohibitive key resource consumption, thus significantly hindering practical deployment. To address this issue, we propose QuIKS, an instant key supply scheme based on adaptive buffering, offering the dominant advantage of near-zero key supply latency while consuming ultra-low key resources (i.e., ultra-low buffer size). Specifically, it is built upon a novel analytical model that determines the minimum buffer size required to guarantee near-zero-latency key supply performance. Guided by this model, QuIKS introduces a lightweight two-phase control algorithm that dynamically determines key relaying requests and adjusts the buffer size by probing real-time application patterns and network conditions. Experiments on a real QKD network testbed demonstrate that QuIKS achieves near-zero key supply latency while providing a more than 10-fold reduction in key buffer size compared to state-of-the-art schemes.

Related papers

QuIKS: Near-Zero Latency Key Supply with Adaptive Buffering for Resource-Efficient Quantum Key Distribution Networks

Yuxin Chen, Zite Xia, Jian Li +4 more

IEEE Conference on Computer Communications (INFOCOM)•May 18, 2026•0 citations

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.

Globecom•Dec 8, 2024•2 citations

Decentralized key distribution versus on-demand relaying for QKD networks

María Álvarez-Roa, Catalina Stan, Sebastian R. Verschoor +2 more

Quantum key distribution (QKD) allows the distribution of secret keys for quantum-secure communication between two distant parties, vital in the quantum computing era in order to protect against quantum-enabled attackers. However, overcoming rate-distance limits in QKD and the establishment of quantum key distribution networks necessitate key relaying over trusted nodes. This process may be resource-intensive, consuming a substantial share of the scarce QKD key material to establish end-to-end secret keys. Hence, an efficient scheme for key relaying and the establishment of end-to-end key pools is essential for practical and extended quantum-secured networking. In this paper, we propose and compare two protocols for managing, storing, and distributing secret key material in QKD networks, addressing challenges such as the success rate of key requests, key consumption, and overhead resulting from relaying. We present an innovative, fully decentralized key distribution strategy as an alternative to the traditional hop-by-hop relaying via trusted nodes, where three experiments are considered to evaluate performance metrics under varying key demand. Our results show that the decentralized pre-flooding approach achieves higher success rates as application demands increase. This analysis highlights the strengths of each approach in enhancing QKD network performance, offering valuable insights for developing robust key distribution strategies in different scenarios.

Journal of Optical Communications and Networking•Jun 23, 2025•7 citations

A Quantum Key Distribution Routing Scheme for a Zero-Trust QKD Network System: A Moving Target Defense Approach

Esraa M. Ghourab, Mohamed Azab, Denis Gračanin

Quantum key distribution (QKD), a key application of quantum information technology and “one-time pad” (OTP) encryption, enables secure key exchange with information-theoretic security, meaning its security is grounded in the laws of physics rather than computational assumptions. However, in QKD networks, achieving long-distance communication often requires trusted relays to mitigate channel losses. This reliance introduces significant challenges, including vulnerabilities to compromised relays and the high costs of infrastructure, which hinder widespread deployment. To address these limitations, we propose a zero-trust spatiotemporal diversification framework for multipath–multi-key distribution. The proposed approach enhances the security of end-to-end key distribution by dynamically shuffling key exchange routes, enabling secure multipath key distribution. Furthermore, it incorporates a dynamic adaptive path recovery mechanism that leverages a recursive penalty model to identify and exclude suspicious or compromised relay nodes. To validate this framework, we conducted extensive simulations and compared its performance against established multipath QKD methods. The results demonstrate that the proposed approach achieves a 97.22% lower attack success rate with 20% attacker pervasiveness and a 91.42% reduction in the attack success rate for single key transmission. The total security percentage improves by 35% under 20% attacker pervasiveness, and security enhancement reaches 79.6% when increasing QKD pairs. Additionally, the proposed scheme exhibits an 86.04% improvement in defense against interception and nearly doubles the key distribution success rate compared to traditional methods. The results demonstrate that the proposed approach significantly improves both security robustness and efficiency, underscoring its potential to advance the practical deployment of QKD networks.

Big Data and Cognitive Computing•Mar 26, 2025•9 citations

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, 2025•1 citation

An Asynchronous Key Relay Protocol Design for Large-Scale Quantum Key Distribution Networks

Yuxin Chen, Jian Li, Zhonghui Li +4 more

Quantum key distribution (QKD) networks can provide information-theoretically secure key distribution between distant end nodes through key relaying. In QKD networks, the key relay protocol is vital since it provides the coordination specifications between nodes for key relaying and thus directly determines the performance, especially as the network scale expands. However, most existing protocols adopt a synchronous contend-and-relay approach, where the contention and consumption of quantum keys occur simultaneously, neglecting the storable nature of quantum keys and presenting significant challenges in reliability and quantum key utilization. To tackle these challenges, in this paper, we propose an asynchronous key relay protocol (AKRP). AKRP considers the storable nature of quantum keys, and adopts a reserve-then-relay approach to achieve lossless and zero-queuing key relaying through precise management of quantum keys and requests. On this basis, to further improve the performance of the proposed AKRP, we design two enhanced mechanisms, i.e., collision detection and resolution mechanism and multipath routing extension. The former enhances the consensus efficiency of AKRP and provides fine-grained key utilization on each link, and the latter utilizes quantum keys on possible relay paths and thus effectively copes with quantum key exhaustion. By conducting extensive experiments on a semi-physical real QKD network platform, results demonstrate that AKRP is superior to existing schemes in terms of end-to-end key throughput, quantum key consumption, and relaying latency.

IEEE Transactions on Networking•Jun 23, 2025•1 citation
Quantum key distribution (QKD) networks provide information-theoretically secure keys for distant parties, emerging as a vital alternative to classical cryptography infrastructures threatened by quantum computing. In QKD networks, the immediacy of key supply service is crucial to the security and performance of applications, as their data must be encrypted before transmission. While key buffering can enable instant key supply services, existing schemes rely on heuristic solutions that incur prohibitive key resource consumption, thus significantly hindering practical deployment. To address this issue, we propose QuIKS, an instant key supply scheme based on adaptive buffering, offering the dominant advantage of near-zero key supply latency while consuming ultra-low key resources (i.e., ultra-low buffer size). Specifically, it is built upon a novel analytical model that determines the minimum buffer size required to guarantee near-zero-latency key supply performance. Guided by this model, QuIKS introduces a lightweight two-phase control algorithm that dynamically determines key relaying requests and adjusts the buffer size by probing real-time application patterns and network conditions. Experiments on a real QKD network testbed demonstrate that QuIKS achieves near-zero key supply latency while providing a more than 10-fold reduction in key buffer size compared to state-of-the-art schemes.
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.
Quantum key distribution (QKD) allows the distribution of secret keys for quantum-secure communication between two distant parties, vital in the quantum computing era in order to protect against quantum-enabled attackers. However, overcoming rate-distance limits in QKD and the establishment of quantum key distribution networks necessitate key relaying over trusted nodes. This process may be resource-intensive, consuming a substantial share of the scarce QKD key material to establish end-to-end secret keys. Hence, an efficient scheme for key relaying and the establishment of end-to-end key pools is essential for practical and extended quantum-secured networking. In this paper, we propose and compare two protocols for managing, storing, and distributing secret key material in QKD networks, addressing challenges such as the success rate of key requests, key consumption, and overhead resulting from relaying. We present an innovative, fully decentralized key distribution strategy as an alternative to the traditional hop-by-hop relaying via trusted nodes, where three experiments are considered to evaluate performance metrics under varying key demand. Our results show that the decentralized pre-flooding approach achieves higher success rates as application demands increase. This analysis highlights the strengths of each approach in enhancing QKD network performance, offering valuable insights for developing robust key distribution strategies in different scenarios.
Quantum key distribution (QKD), a key application of quantum information technology and “one-time pad” (OTP) encryption, enables secure key exchange with information-theoretic security, meaning its security is grounded in the laws of physics rather than computational assumptions. However, in QKD networks, achieving long-distance communication often requires trusted relays to mitigate channel losses. This reliance introduces significant challenges, including vulnerabilities to compromised relays and the high costs of infrastructure, which hinder widespread deployment. To address these limitations, we propose a zero-trust spatiotemporal diversification framework for multipath–multi-key distribution. The proposed approach enhances the security of end-to-end key distribution by dynamically shuffling key exchange routes, enabling secure multipath key distribution. Furthermore, it incorporates a dynamic adaptive path recovery mechanism that leverages a recursive penalty model to identify and exclude suspicious or compromised relay nodes. To validate this framework, we conducted extensive simulations and compared its performance against established multipath QKD methods. The results demonstrate that the proposed approach achieves a 97.22% lower attack success rate with 20% attacker pervasiveness and a 91.42% reduction in the attack success rate for single key transmission. The total security percentage improves by 35% under 20% attacker pervasiveness, and security enhancement reaches 79.6% when increasing QKD pairs. Additionally, the proposed scheme exhibits an 86.04% improvement in defense against interception and nearly doubles the key distribution success rate compared to traditional methods. The results demonstrate that the proposed approach significantly improves both security robustness and efficiency, underscoring its potential to advance the practical deployment of QKD networks.
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.
Quantum key distribution (QKD) networks can provide information-theoretically secure key distribution between distant end nodes through key relaying. In QKD networks, the key relay protocol is vital since it provides the coordination specifications between nodes for key relaying and thus directly determines the performance, especially as the network scale expands. However, most existing protocols adopt a synchronous contend-and-relay approach, where the contention and consumption of quantum keys occur simultaneously, neglecting the storable nature of quantum keys and presenting significant challenges in reliability and quantum key utilization. To tackle these challenges, in this paper, we propose an asynchronous key relay protocol (AKRP). AKRP considers the storable nature of quantum keys, and adopts a reserve-then-relay approach to achieve lossless and zero-queuing key relaying through precise management of quantum keys and requests. On this basis, to further improve the performance of the proposed AKRP, we design two enhanced mechanisms, i.e., collision detection and resolution mechanism and multipath routing extension. The former enhances the consensus efficiency of AKRP and provides fine-grained key utilization on each link, and the latter utilizes quantum keys on possible relay paths and thus effectively copes with quantum key exhaustion. By conducting extensive experiments on a semi-physical real QKD network platform, results demonstrate that AKRP is superior to existing schemes in terms of end-to-end key throughput, quantum key consumption, and relaying latency.