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

International Conference on Communications, Circuits and Systems

A Self-Synchronization Scheme of Quantum Key Transmission Based on Dual Key Pools

Yan Feng, Sijiang Xie, Nian Liu, Yalong Yan

Published May 23, 2025• 0 citations
Publisher

Abstract

In a quantum key distribution (QKD) network based on trusted relays, quantum key fragments may be lost due to the unreliability of network transmission during the transmission of quantum keys for end-to-end cryptographic applications through these relays. Consequently, the keys at both ends are out of sync. A self-synchronization scheme of quantum key transmission is proposed to address this issue and to ensure consistent quantum keys between non-adjacent network nodes. In this scheme, each network node establishes two types of key pools: the neighbor pool (NP) and the cross pool (CP). The keys of the CP in the sending node are divided into key fragments, and each fragment is encrypted with the keys in the NP using the one-time pad (OTP) method before being transmitted to the receiving node. The receiving node only stores the key fragments that are correctly received in the corresponding locations of the CP, ensuring key consistency between the sending and receiving nodes through error handling mechanisms. Under this scheme, if the receiving node does not receive the key fragments due to errors or packet loss during the key transmission process, it will no longer initiate data retransmission and other operations, thereby avoiding multiple interactions between the sending and receiving nodes and improving the efficiency of key transmission.

DOI
10.1109/icccas65806.2025.11102590

Related papers

Hybrid quantum key distribution: A novel approach for secure end-to-end communication in network infrastructure

Sellami Ali

The Quantum Key Distribution (QKD) network approach has emerged as a promising solution and has garnered significant interest across various domains. QKD networks can be broadly categorized into two main types: those based on measurement-device-dependent (MDD) protocols and those based on measurement-device-independent (MDI) protocols. A novel network scheme is proposed combining these two protocols to guarantee end-to-end secure communication. It comprises two interconnected networks — the first uses a measurement-device-dependent protocol to connect routers with nearby nodes, while the second employs a measurement-device-independent protocol to interconnect the routers. In the first network, the process begins with Alice (Router) generating two types of weak quantum signals — the first has intensity, frequency and polarization or phase randomly varied, while the second with different delay times. Alice randomly transmits either signal states carrying information or decoy states with varying properties to the receivers (Bobs) over the quantum channels. She also sends a synchronization signal along with the quantum signals. At the receiver end, the synchronization pulse timestamps the incoming quantum signals. Each Bob then randomly shifts the frequencies of the received signals and measures their phase/polarization of the first signal and measures the delay times of the second signal. The secret key is derived by combining the frequency, the delay time and the phase/polarization information of the quantum signals, resulting in longer key lengths. Encoding information across multiple degrees of freedom enables extended key generation for secure communication. However, between the routers, MDI-QKD protocols are used to securely share the keys. This hybrid approach aims to ensure secure end-to-end communication across the network.

Modern Physics Letters A•Aug 29, 2024•0 citations

A Segment-Based Multipath Distribution Method in Partially-Trusted Relay Quantum Networks

Mingjun Wang, Jian Li, Kaiping Xue +6 more

As a promising application of quantum information technology, Quantum Key Distribution (QKD) can provide information-theoretically secure key exchange for adjacent communication parties. To achieve long-distance secure communication and scale expansion against inherent channel loss, trusted relays, which are assumed to be absolutely secure, are introduced into QKD networks. However, in practice, trusted relays may be compromised by attacks from ubiquitous eavesdroppers even protected by powerful hardware. Thus, how to ensure the security of end-to-end key distribution in partially-trusted relay QKD networks with the coexistence of trusted relays and untrusted relays becomes a challenging but urgent problem to be solved. To address this critical problem, in this article, we design a segment-based multipath key distribution method. The basic idea of the method is to maximize the security of the end-to-end key distribution through the segment-based multipath key distribution. Under the premise of security level requirements, we further propose a flexible key reconstruction scheme to improve the efficiency of key distribution and obtain available secret keys as many as possible. The extensive simulations are conducted and the results reveal that our method significantly outperforms the traditional multipath QKD method in terms of both security and efficiency.

IEEE Communications Magazine•Mar 7, 2023•27 citations

Extending quantum key distribution through proxy re-encryption

Nathan Lemons, Boris Gelfand, Nigel Lawrence +6 more

Modern quantum key distribution (QKD) network designs are based on sending photons from one node to another and require free-space or dedicated fiber optic cables between nodes. The purpose of this is to co-generate secret key material on both sides of the quantum channel. In addition to this quantum link, there are several insecure classical channels that allow QKD algorithms to exchange book-keeping information and send symmetrically encrypted data. The attenuation of photons transmitted through fiber becomes too high to practically generate key material over fiber at distances of more than 100 km. Free-space transmission through the atmosphere or the vacuum of space can reduce attenuation, but at the cost of system complexity and sensitivity to other impairments, such as weather. To extend the effective range of QKD networks, we present a method that combines QKD algorithms with post-quantum, homomorphic key-switching to allow multiple parties to effectively share secret key material over longer distances through semi-trusted relay nodes. We define how such a system should work for arbitrary network topologies and provide proofs that our scheme is both correct and secure. We assess the feasibility of this solution by building and evaluating two implementations based on lattice-based cryptography: learning with errors.

Journal of Optical Communications and Networking•May 26, 2023•9 citations

Wide Area Key Distribution Network Based on a Quantum Key Distribution System

Hua Dong, Yaqi Song, Li Yang

The point-to-point quantum key distribution (QKD) system is limited by the transmission distance. So, the wide area QKD network with multiple endpoints is the research focus of this study. The relay-node scenario and key relay protocols provide the solutions to the QKD network. The early key relay protocols require the relay nodes to be reliable. Once the relay nodes become compromised, the whole network is insecure. In this paper, we extend the chain structure of the public-XOR(exclusive OR)-key scheme with two endpoints to the complex network with multiple endpoints. The relay nodes in our scheme do not need encryption actions, decryption actions, or storage XOR keys, which simplifies the system compared with other key distribution schemes based on trusted relay nodes. Our scheme not only improves the practical performance and simplifies the system’s complexity, but it also ensures that the security is not reduced. Specifically, we rigorously demonstrate that an eavesdropper can never access the key shared by the users of the network as long as the process of generating XOR keys and destroying the original keys is secure. In addition, we discuss the information leakage of the practical QKD network from the perspective of the unicity distance.

Applied Sciences•Mar 14, 2019•10 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•3 citations

Exploring Quantum Key Distribution Routing Algorithms

João Barreirinhas, Rita Girão‐Silva, Teresa Gomes +1 more

Quantum Key Distribution allows the exchange of symmetric keys with information-theoretic security between adjacent nodes. Key relay techniques in Quantum Key Distribution Networks (QKDNs) address the need for symmetric keys between nodes that are either too distant for establishing a quantum link or separated by intermediate nodes. The Secure Key Rate is limited, which triggers a need to use buffers (Quantum Key Pools) to store keys for later use. The secure key relay uses One-Time Pad, thus the number of links in the route impacts the number of keys used to deliver a pair of symmetric keys. The need for efficient routing algorithms in QKDNs has led to different routing algorithms. This work revisits some routing approaches that have been improved here. Results show that using asymmetrical link costs reduces blocking, a Long Short-Term Memory approach is enhanced by including cross-validation, and finally some strategies to reduce management traffic are proposed.

International Conference on the Design of Reliable Communication Networks (DRCN)•May 12, 2025•1 citation
In a quantum key distribution (QKD) network based on trusted relays, quantum key fragments may be lost due to the unreliability of network transmission during the transmission of quantum keys for end-to-end cryptographic applications through these relays. Consequently, the keys at both ends are out of sync. A self-synchronization scheme of quantum key transmission is proposed to address this issue and to ensure consistent quantum keys between non-adjacent network nodes. In this scheme, each network node establishes two types of key pools: the neighbor pool (NP) and the cross pool (CP). The keys of the CP in the sending node are divided into key fragments, and each fragment is encrypted with the keys in the NP using the one-time pad (OTP) method before being transmitted to the receiving node. The receiving node only stores the key fragments that are correctly received in the corresponding locations of the CP, ensuring key consistency between the sending and receiving nodes through error handling mechanisms. Under this scheme, if the receiving node does not receive the key fragments due to errors or packet loss during the key transmission process, it will no longer initiate data retransmission and other operations, thereby avoiding multiple interactions between the sending and receiving nodes and improving the efficiency of key transmission.
The Quantum Key Distribution (QKD) network approach has emerged as a promising solution and has garnered significant interest across various domains. QKD networks can be broadly categorized into two main types: those based on measurement-device-dependent (MDD) protocols and those based on measurement-device-independent (MDI) protocols. A novel network scheme is proposed combining these two protocols to guarantee end-to-end secure communication. It comprises two interconnected networks — the first uses a measurement-device-dependent protocol to connect routers with nearby nodes, while the second employs a measurement-device-independent protocol to interconnect the routers. In the first network, the process begins with Alice (Router) generating two types of weak quantum signals — the first has intensity, frequency and polarization or phase randomly varied, while the second with different delay times. Alice randomly transmits either signal states carrying information or decoy states with varying properties to the receivers (Bobs) over the quantum channels. She also sends a synchronization signal along with the quantum signals. At the receiver end, the synchronization pulse timestamps the incoming quantum signals. Each Bob then randomly shifts the frequencies of the received signals and measures their phase/polarization of the first signal and measures the delay times of the second signal. The secret key is derived by combining the frequency, the delay time and the phase/polarization information of the quantum signals, resulting in longer key lengths. Encoding information across multiple degrees of freedom enables extended key generation for secure communication. However, between the routers, MDI-QKD protocols are used to securely share the keys. This hybrid approach aims to ensure secure end-to-end communication across the network.
As a promising application of quantum information technology, Quantum Key Distribution (QKD) can provide information-theoretically secure key exchange for adjacent communication parties. To achieve long-distance secure communication and scale expansion against inherent channel loss, trusted relays, which are assumed to be absolutely secure, are introduced into QKD networks. However, in practice, trusted relays may be compromised by attacks from ubiquitous eavesdroppers even protected by powerful hardware. Thus, how to ensure the security of end-to-end key distribution in partially-trusted relay QKD networks with the coexistence of trusted relays and untrusted relays becomes a challenging but urgent problem to be solved. To address this critical problem, in this article, we design a segment-based multipath key distribution method. The basic idea of the method is to maximize the security of the end-to-end key distribution through the segment-based multipath key distribution. Under the premise of security level requirements, we further propose a flexible key reconstruction scheme to improve the efficiency of key distribution and obtain available secret keys as many as possible. The extensive simulations are conducted and the results reveal that our method significantly outperforms the traditional multipath QKD method in terms of both security and efficiency.
Modern quantum key distribution (QKD) network designs are based on sending photons from one node to another and require free-space or dedicated fiber optic cables between nodes. The purpose of this is to co-generate secret key material on both sides of the quantum channel. In addition to this quantum link, there are several insecure classical channels that allow QKD algorithms to exchange book-keeping information and send symmetrically encrypted data. The attenuation of photons transmitted through fiber becomes too high to practically generate key material over fiber at distances of more than 100 km. Free-space transmission through the atmosphere or the vacuum of space can reduce attenuation, but at the cost of system complexity and sensitivity to other impairments, such as weather. To extend the effective range of QKD networks, we present a method that combines QKD algorithms with post-quantum, homomorphic key-switching to allow multiple parties to effectively share secret key material over longer distances through semi-trusted relay nodes. We define how such a system should work for arbitrary network topologies and provide proofs that our scheme is both correct and secure. We assess the feasibility of this solution by building and evaluating two implementations based on lattice-based cryptography: learning with errors.
The point-to-point quantum key distribution (QKD) system is limited by the transmission distance. So, the wide area QKD network with multiple endpoints is the research focus of this study. The relay-node scenario and key relay protocols provide the solutions to the QKD network. The early key relay protocols require the relay nodes to be reliable. Once the relay nodes become compromised, the whole network is insecure. In this paper, we extend the chain structure of the public-XOR(exclusive OR)-key scheme with two endpoints to the complex network with multiple endpoints. The relay nodes in our scheme do not need encryption actions, decryption actions, or storage XOR keys, which simplifies the system compared with other key distribution schemes based on trusted relay nodes. Our scheme not only improves the practical performance and simplifies the system’s complexity, but it also ensures that the security is not reduced. Specifically, we rigorously demonstrate that an eavesdropper can never access the key shared by the users of the network as long as the process of generating XOR keys and destroying the original keys is secure. In addition, we discuss the information leakage of the practical QKD network from the perspective of the unicity distance.
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 allows the exchange of symmetric keys with information-theoretic security between adjacent nodes. Key relay techniques in Quantum Key Distribution Networks (QKDNs) address the need for symmetric keys between nodes that are either too distant for establishing a quantum link or separated by intermediate nodes. The Secure Key Rate is limited, which triggers a need to use buffers (Quantum Key Pools) to store keys for later use. The secure key relay uses One-Time Pad, thus the number of links in the route impacts the number of keys used to deliver a pair of symmetric keys. The need for efficient routing algorithms in QKDNs has led to different routing algorithms. This work revisits some routing approaches that have been improved here. Results show that using asymmetrical link costs reduces blocking, a Long Short-Term Memory approach is enhanced by including cross-validation, and finally some strategies to reduce management traffic are proposed.