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

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.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icccas65806.2025.11102590
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Yalong Yan, Sijiang Xie, Nian Liu, Yan Feng
Quantum Information and Cryptography
article

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

Yalong Yan, Sijiang Xie, Nian Liu, Yan Feng
article en

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.

University of Science and Technology of China (CN), Beijing Electronic Science and Technology Institute (CN)
Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 89%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.