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

A Security Real-time Privacy Amplification Scheme in QKD System

Baokang Zhao, Bo Liu, Chunqing Wu

Published Apr 7, 2020• 2 citations
Publisher

Abstract

Quantum Key Distribution (QKD) technology, based on the laws of physics, can create unconditional security keys between communication parties. In recent years, researchers draw more and more attention to the QKD technology. Privacy amplification is a very significant procedure in QKD system. In this paper, we propose the real-time privacy amplification (RTPA) scheme which converts the weak secret string to a uniform key that is fully secret from Eve. Our detailed proofs show the security of our RTPA scheme. In order to prevent the potential man-in-middle attacks, we employ an authentication procedure to RTPA scheme (ARTPA) with the "-XOR almost universal hash functions. We implement our ARTPA scheme based on CLIP system, which is connected to the quantum communication system. Considering the privacy amplification and authentication overhead and the finite size effect on the security of final keys, we set the secret key length be 256k before privacy amplification and the authentication tag length be 60. Our experimental results show the efficiency of the proposed ARTPA scheme.

DOI
10.3217/jucs-019-16-2420

Related papers

High-Speed Implementation of Length-Compatible Privacy Amplification in Continuous-Variable Quantum Key Distribution

Xiangyu Wang, Yichen Zhang, Song Yu +1 more

Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of a CV-QKD system. We report the high-speed parallel implementation of the length-compatible privacy amplification algorithm based on a graphic processing unit. The length-compatible algorithm is used to satisfy the security requirements of privacy amplification at different transmission distances when considering finite-size effect. We achieve the speed of privacy amplification over 1 Gb/s at arbitrary input length and the speed is one to two orders of magnitude faster than previous demonstrations, which supports the high-speed real-time CV-QKD system and ensures the security of privacy amplification.

arXiv:1805.02372•IEEE photonics journal•Apr 9, 2018•233 citations

Memory-Saving Implementation of High-Speed Privacy Amplification Algorithm for Continuous-Variable Quantum Key Distribution

Dengwen Li, Peng Huang, Yingming Zhou +2 more

Privacy amplification is an indispensable procedure to share secure secret key between legitimate parties in quantum key distribution (QKD) because a portion of bits are still leaked to eavesdropper Eve after the secret reconciliation. Here, we propose a novel privacy amplification scheme with an optimal hash function. In particular, by utilizing the linear feedback shift register (LFSR) technique, we optimize and simplify the construction of the Toeplitz matrix. In this way, the LFSR-based Toeplitz matrix is used to execute the privacy amplification algorithm. The hardware storage resources can then be drastically saved, and the time consuming will be only about half of that without using the LFSR-based Toeplitz matrix. This work breaks the bottleneck of privacy amplification in high-speed continuous-variable QKD (CVQKD), and thus contributes to the real-time performance of the whole CVQKD system.

IEEE photonics journal•Aug 14, 2018•19 citations

FiT-PA: Fixed Scale FFT Based Privacy Amplification Algorithm for Quantum Key Distribution

Bo Liu, Baokang Zhao, Wanrong Yu +1 more

Quantum Key Distribution (QKD) technology, based on basic principles of quantum mechanics, can generate unconditional security keys for communication parties. Privacy amplification, which ensures the security of generated keys, is the most significant procedure of QKD systems. Focusing on meeting the real-time and highperformance requirements of GHz high-speed QKD systems, we proposed a novel Fixed Scale FFT based Privacy Amplification (FiT-PA) algorithm and implemented on MIC platform efficiently. The experimental results show the efficiency of FiT-PA algorithm. The throughput of FiTPA algorithm reaches to 60.443 Mbps with the raw key length of 12.8 M. FiT-PA algorithm can satisfy the real-time performance demands of GHz high-speed QKD systems.

網際網路技術學刊•Mar 1, 2016•9 citations

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

Bingze, Yan, Qiong Li, Haokun, Mao +1 more

Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.6*10^8 input block size) is twice higher than the best existing scheme (140Mbps@1*10^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.

arXiv:2105.13678•May 28, 2021•2 citations

Lightweight Authentication for Quantum Key Distribution

Evgeniy O. Kiktenko, Aleksei Malyshev, Maxim A. Gavreev +4 more

Quantum key distribution (QKD) enables unconditionally secure communication between distinct parties using a quantum channel and an authentic public channel. Reducing the portion of quantum-generated secret keys, that is consumed during the authentication procedure, is of significant importance for improving the performance of QKD systems. In the present work, we develop a lightweight authentication protocol for QKD based on a `ping-pong' scheme of authenticity check for QKD. An important feature of this scheme is that the only one authentication tag is generated and transmitted during each of the QKD post-processing rounds. For the tag generation purpose, we design an unconditionally secure procedure based on the concept of key recycling. The procedure is based on the combination of almost universal2polynomial hashing, XOR universal2Toeplitz hashing, and one-time pad (OTP) encryption. We demonstrate how to minimize both the length of the recycled key and the size of the authentication key, that is required for OTP encryption. As a result, in real case scenarios, the portion of quantum-generated secret keys that is consumed for the authentication purposes is below 1%. Finally, we provide a security analysis of the full quantum key growing process in the framework of universally composable security.

arXiv:1903.10237•IEEE Transactions on Information Theory•Apr 22, 2020•44 citations

A Strong Privacy Amplification Protocol by Unconditionally Secure Authentication

Liu Sheng

Communications over the public channel should be authenticated to make privacy amplification against active adversaries possible. A new method of constructing authentication codes from error correcting codes is proposed and analyzed, and an arbitrary q ary code( q is a prime power) can be transformed into an authentication code according to the method. When the two communicants share n bit partially secret string S , an authentication scheme can be constructed from a ( 2 m,k,2 m-k+1 ) extended Reed Solomon code, where m=[XXZS-ZSX*3Y0]n/k[XXYS-YSX*3Y0] and 2 mk . As long as the two parties share an authentication key of at least 3 m bit, there exists a strong protocol for privacy amplification which ensures that the probability that the adversary successfully implements active attacks is at most k/2 m , and a highly secret string can be distilled of length about the Renyi entropy of S when given Eve's complete knowledge U=u about S . As n is large enough, more than 3 m bits secret string can always be distilled, thus the protocol is practical.

Chinese Journal of Computers•Jan 1, 2000•0 citations
Quantum Key Distribution (QKD) technology, based on the laws of physics, can create unconditional security keys between communication parties. In recent years, researchers draw more and more attention to the QKD technology. Privacy amplification is a very significant procedure in QKD system. In this paper, we propose the real-time privacy amplification (RTPA) scheme which converts the weak secret string to a uniform key that is fully secret from Eve. Our detailed proofs show the security of our RTPA scheme. In order to prevent the potential man-in-middle attacks, we employ an authentication procedure to RTPA scheme (ARTPA) with the "-XOR almost universal hash functions. We implement our ARTPA scheme based on CLIP system, which is connected to the quantum communication system. Considering the privacy amplification and authentication overhead and the finite size effect on the security of final keys, we set the secret key length be 256k before privacy amplification and the authentication tag length be 60. Our experimental results show the efficiency of the proposed ARTPA scheme.
Privacy amplification is an indispensable step in postprocessing of continuous-variable quantum key distribution (CV-QKD), which is used to distill unconditional secure keys from identical corrected keys between two distant legal parties. The processing speed of privacy amplification has a significant effect on the secret key rate of a CV-QKD system. We report the high-speed parallel implementation of the length-compatible privacy amplification algorithm based on a graphic processing unit. The length-compatible algorithm is used to satisfy the security requirements of privacy amplification at different transmission distances when considering finite-size effect. We achieve the speed of privacy amplification over 1 Gb/s at arbitrary input length and the speed is one to two orders of magnitude faster than previous demonstrations, which supports the high-speed real-time CV-QKD system and ensures the security of privacy amplification.
Privacy amplification is an indispensable procedure to share secure secret key between legitimate parties in quantum key distribution (QKD) because a portion of bits are still leaked to eavesdropper Eve after the secret reconciliation. Here, we propose a novel privacy amplification scheme with an optimal hash function. In particular, by utilizing the linear feedback shift register (LFSR) technique, we optimize and simplify the construction of the Toeplitz matrix. In this way, the LFSR-based Toeplitz matrix is used to execute the privacy amplification algorithm. The hardware storage resources can then be drastically saved, and the time consuming will be only about half of that without using the LFSR-based Toeplitz matrix. This work breaks the bottleneck of privacy amplification in high-speed continuous-variable QKD (CVQKD), and thus contributes to the real-time performance of the whole CVQKD system.
Quantum Key Distribution (QKD) technology, based on basic principles of quantum mechanics, can generate unconditional security keys for communication parties. Privacy amplification, which ensures the security of generated keys, is the most significant procedure of QKD systems. Focusing on meeting the real-time and highperformance requirements of GHz high-speed QKD systems, we proposed a novel Fixed Scale FFT based Privacy Amplification (FiT-PA) algorithm and implemented on MIC platform efficiently. The experimental results show the efficiency of FiT-PA algorithm. The throughput of FiTPA algorithm reaches to 60.443 Mbps with the raw key length of 12.8 M. FiT-PA algorithm can satisfy the real-time performance demands of GHz high-speed QKD systems.
Privacy amplification (PA) is an essential part in a quantum key distribution (QKD) system, distilling a highly secure key from a partially secure string by public negotiation between two parties. The optimization objectives of privacy amplification for QKD are large block size, high throughput and low cost. For the global optimization of these objectives, a novel privacy amplification algorithm is proposed in this paper by combining multilinear-modular-hashing and modular arithmetic hashing. This paper proves the security of this hybrid hashing PA algorithm within the framework of both information theory and composition security theory. A scheme based on this algorithm is implemented and evaluated on a CPU platform. The results on a typical CV-QKD system indicate that the throughput of this scheme (261Mbps@2.6*10^8 input block size) is twice higher than the best existing scheme (140Mbps@1*10^8 input block size). Moreover, This scheme is implemented on a mobile CPU platform instead of a desktop CPU or a server CPU, which means that this algorithm has a better performance with a much lower cost and power consumption.
Quantum key distribution (QKD) enables unconditionally secure communication between distinct parties using a quantum channel and an authentic public channel. Reducing the portion of quantum-generated secret keys, that is consumed during the authentication procedure, is of significant importance for improving the performance of QKD systems. In the present work, we develop a lightweight authentication protocol for QKD based on a `ping-pong' scheme of authenticity check for QKD. An important feature of this scheme is that the only one authentication tag is generated and transmitted during each of the QKD post-processing rounds. For the tag generation purpose, we design an unconditionally secure procedure based on the concept of key recycling. The procedure is based on the combination of almost universal2polynomial hashing, XOR universal2Toeplitz hashing, and one-time pad (OTP) encryption. We demonstrate how to minimize both the length of the recycled key and the size of the authentication key, that is required for OTP encryption. As a result, in real case scenarios, the portion of quantum-generated secret keys that is consumed for the authentication purposes is below 1%. Finally, we provide a security analysis of the full quantum key growing process in the framework of universally composable security.
Communications over the public channel should be authenticated to make privacy amplification against active adversaries possible. A new method of constructing authentication codes from error correcting codes is proposed and analyzed, and an arbitrary q ary code( q is a prime power) can be transformed into an authentication code according to the method. When the two communicants share n bit partially secret string S , an authentication scheme can be constructed from a ( 2 m,k,2 m-k+1 ) extended Reed Solomon code, where m=[XXZS-ZSX*3Y0]n/k[XXYS-YSX*3Y0] and 2 mk . As long as the two parties share an authentication key of at least 3 m bit, there exists a strong protocol for privacy amplification which ensures that the probability that the adversary successfully implements active attacks is at most k/2 m , and a highly secret string can be distilled of length about the Renyi entropy of S when given Eve's complete knowledge U=u about S . As n is large enough, more than 3 m bits secret string can always be distilled, thus the protocol is practical.