Generalized privacy amplification
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (6) , 1915-1923
- https://doi.org/10.1109/18.476316
Abstract
This paper, provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distil a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper's information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacityKeywords
This publication has 28 references indexed in Scilit:
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming BoundsSIAM Journal on Discrete Mathematics, 1996
- Quantum key distribution over distances as long as 30 kmOptics Letters, 1995
- Experimental Demonstration of Quantum Cryptography Using Polarized Photons in Optical Fibre over More than 1 kmEurophysics Letters, 1993
- Common randomness in information theory and cryptography. I. Secret sharingIEEE Transactions on Information Theory, 1993
- Quantum cryptography without Bell’s theoremPhysical Review Letters, 1992
- Privacy Amplification by Public DiscussionSIAM Journal on Computing, 1988
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976