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

Lecture notes in computer science

A Novel Resource-Efficient Privacy Amplification Scheme: Towards Ground-Satellite Quantum Key Distribution Post-processing

Zhenning Zhang, Chunqing Wu, Baokang Zhao, Bo Liu

Published Jan 1, 2014• 0 citations
Publisher
DOI
10.1007/978-3-319-07782-6_31

Related papers

Scheme Design of Highly Efficient Privacy Amplification with Fewer Random Seeds in Quantum Key Distribution

刘翼鹏 Liu Yipeng, 郭建胜 Guo Jiansheng, 崔竞一 Cui Jingyi

Acta Optica Sinica•Jan 1, 2017•0 citations

Efficient Privacy Amplification Algorithms for Quantum Key Distribution

Takeshi Asai, Toyohiro Tsurumaru

IEICE Technical Report; IEICE Tech. Rep.•Feb 24, 2011•5 citations

A Real-Time Privacy Amplification Scheme in Quantum Key Distribution

Bo Liu, Bo Liu, Baokang Zhao +4 more

Lecture notes in computer science•Jan 1, 2013•8 citations

An efficient hybrid hash based privacy amplification algorithm for quantum key distribution

Bingze Yan, Qiong Li, Haokun Mao +1 more

Quantum Information Processing•Mar 31, 2022•18 citations

Improved polar-code-based efficient post-processing algorithm for quantum key distribution

Junbin Fang, Zhengzhong Yi, Jin Li +5 more

Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner's wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.

arXiv:2112.10586•Scientific Reports•Jun 16, 2022•9 citations

Joint Information Reconciliation-Privacy Amplification Scheme for CV-QKD

Kun Zhang, Jia Hou, Yan Feng +4 more

In the conventional post-processing phase of Gaussian-modulated coherent state (GMCS) quantum key distribution (QKD) systems, the processes of information reconciliation (IR) and privacy amplification (PA) are typically carried out sequentially and separately. This approach incurs substantial computational complexity and may introduce potential security risks, such as key storage risks. In this paper, we propose a more efficient and secure post-processing scheme that integrates IR and PA into a single process by utilizing well-designed spinal codes. The proposed scheme significantly reduces computational complexity by employing the linear-complexity hash function instead of the superlinear complexity Toeplitz matrices used in conventional PA schemes, and effectively mitigates potential security risks associated with conducting IR and PA as separate processes. Experimental results show that the final secret key throughput of the proposed scheme is at least 250 times higher than that of the conventional PA scheme, with the improvement in throughput becoming even greater as the block lengths increase. More importantly, owing to the rateless property and the capacity-approaching performance of spinal codes, the GMCS QKD systems can achieve reconciliation efficiencies of higher than 97% across a broad range of signal-to-noise ratios from -22.5641 to 0.122 dB.

Journal of Lightwave Technology•Aug 27, 2025•0 citations
Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner's wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.
In the conventional post-processing phase of Gaussian-modulated coherent state (GMCS) quantum key distribution (QKD) systems, the processes of information reconciliation (IR) and privacy amplification (PA) are typically carried out sequentially and separately. This approach incurs substantial computational complexity and may introduce potential security risks, such as key storage risks. In this paper, we propose a more efficient and secure post-processing scheme that integrates IR and PA into a single process by utilizing well-designed spinal codes. The proposed scheme significantly reduces computational complexity by employing the linear-complexity hash function instead of the superlinear complexity Toeplitz matrices used in conventional PA schemes, and effectively mitigates potential security risks associated with conducting IR and PA as separate processes. Experimental results show that the final secret key throughput of the proposed scheme is at least 250 times higher than that of the conventional PA scheme, with the improvement in throughput becoming even greater as the block lengths increase. More importantly, owing to the rateless property and the capacity-approaching performance of spinal codes, the GMCS QKD systems can achieve reconciliation efficiencies of higher than 97% across a broad range of signal-to-noise ratios from -22.5641 to 0.122 dB.