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

Springer eBooks

Quantum Privacy Amplification: A Secure Method for Cryptography

Anna Sanpera, Chiara Macchiavello

Published Jan 1, 1997• 0 citations
Publisher
DOI
10.1007/978-94-011-5886-2_46

Related papers

Practical Quantum Cryptography: Secrecy Capacity and Privacy Amplification

F. Javier Thayer, Michael Hamrick, Gerald N. Gilbert

Optical science and engineering•Nov 14, 2005•0 citations

Securing Quantum Communication: An IBM Quantum Lab Simulation Study of the Enhanced BB84 Protocol with Error Correction and Privacy Amplification.

Sujit Biswas, Rajat Subhra Goswami

Abstract Quantum cryptography is a technique used in the area of cryptography that relies on quantum mechanics to securely transfer a key between two parties. The BB84 protocol is a well-known quantum cryptography method that produces a shared key between Alice and Bob by using the polarisation states of photons. This paper presents a comprehensive analysis and implementation of the BB84 protocol with polarization states, using the IBM Quantum Lab Simulator. We demonstrated key generation, error correction, and privacy amplification steps, along with a theoretical analysis of security against eavesdropping attacks of the proposed protocol. Furthermore, the practical limitations and considerations for implementing the protocol are discussed, such as the effects of noise and decoherence in realistic quantum systems. Our findings suggest that the Enhanced BB84 Protocol with Error Correction and Privacy Amplification is a promising approach for secure key distribution in quantum communication and could serve as a foundation for future developments in quantum cryptography.

•Jul 17, 2023•2 citations

Stream Privacy Amplification for Quantum Cryptography

Yizhi Huang, Xingjian Zhang, Xiongfeng Ma

Privacy amplification is the key step to guarantee the security of quantum communication.The existing security proofs require the accumulation of a large number of raw key bits for privacy amplification.This is similar to block ciphers in classical cryptography that would delay the final key generation since an entire block must be accumulated ahead of privacy amplification.Moreover, any leftover errors after information reconciliation would corrupt the entire block.By modifying the security proof based on quantum error correction, we develop a stream privacy-amplification scheme, which resembles the classical stream cipher.This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification ahead of information reconciliation.The stream scheme can also help to enhance the security of trusted-relay quantum networks and improve the practicality of randomness extraction for quantum random number generators.

arXiv:2111.14108•PRX Quantum•Jun 10, 2022•11 citations

Efficient Privacy Amplification Algorithms for Quantum Key Distribution

Takeshi Asai, Toyohiro Tsurumaru

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

Quantum privacy amplification

Chiara Macchiavello

•Jun 1, 2001•1 citation

Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression

Toyohiro Tsurumaru

Privacy amplification (PA) is an indispensable component in classical and quantum cryptography. Error correction (EC) and data compression (DC) algorithms are also indispensable in classical and quantum information theory. We here study these three algorithms (PA, EC, and DC) in the presence of quantum side information, and show that they all become equivalent in the one-shot scenario. As an application of this equivalence, we take previously known security bounds of PA, and translate them into coding theorems for EC and DC which have not been obtained previously. Further, we apply these results to simplify and improve our previous result that the two prevalent approaches to the security proof of quantum key distribution (QKD) are equivalent. We also propose a new method to simplify the security proof of QKD.

arXiv:2009.08823•IEEE Transactions on Information Theory•Nov 8, 2021•11 citations
Abstract Quantum cryptography is a technique used in the area of cryptography that relies on quantum mechanics to securely transfer a key between two parties. The BB84 protocol is a well-known quantum cryptography method that produces a shared key between Alice and Bob by using the polarisation states of photons. This paper presents a comprehensive analysis and implementation of the BB84 protocol with polarization states, using the IBM Quantum Lab Simulator. We demonstrated key generation, error correction, and privacy amplification steps, along with a theoretical analysis of security against eavesdropping attacks of the proposed protocol. Furthermore, the practical limitations and considerations for implementing the protocol are discussed, such as the effects of noise and decoherence in realistic quantum systems. Our findings suggest that the Enhanced BB84 Protocol with Error Correction and Privacy Amplification is a promising approach for secure key distribution in quantum communication and could serve as a foundation for future developments in quantum cryptography.
Privacy amplification is the key step to guarantee the security of quantum communication.The existing security proofs require the accumulation of a large number of raw key bits for privacy amplification.This is similar to block ciphers in classical cryptography that would delay the final key generation since an entire block must be accumulated ahead of privacy amplification.Moreover, any leftover errors after information reconciliation would corrupt the entire block.By modifying the security proof based on quantum error correction, we develop a stream privacy-amplification scheme, which resembles the classical stream cipher.This scheme can output the final key in a stream way, prevent error from spreading, and hence can put privacy amplification ahead of information reconciliation.The stream scheme can also help to enhance the security of trusted-relay quantum networks and improve the practicality of randomness extraction for quantum random number generators.
Privacy amplification (PA) is an indispensable component in classical and quantum cryptography. Error correction (EC) and data compression (DC) algorithms are also indispensable in classical and quantum information theory. We here study these three algorithms (PA, EC, and DC) in the presence of quantum side information, and show that they all become equivalent in the one-shot scenario. As an application of this equivalence, we take previously known security bounds of PA, and translate them into coding theorems for EC and DC which have not been obtained previously. Further, we apply these results to simplify and improve our previous result that the two prevalent approaches to the security proof of quantum key distribution (QKD) are equivalent. We also propose a new method to simplify the security proof of QKD.