Generalized Privacy Ampliication

This paper provides a general treatment of privacy ampliication by public discussion , a concept introduced by Bennett, Brassard and Robert for a special scenario. Privacy ampliication is a protocol that allows two parties to distill a secret key from a common random variable that is only partially secret, i.e. about which an eavesdropper has some partial information , where the two parties generally know nothing about the eavesdropper's information except that it satisses a certain constraint. The results have applications to unconditionally-secure secret-key agreement protocols, quantum cryptography and to a generalized treatment of wire-tap and broadcast channels for a considerably strengthened deenition of secrecy capacity.

[1]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[2]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[3]  A. Rényi.  On Measures of Entropy and Information , 1961 .

[4]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[5]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[6]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[7]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[8]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[9]  Oded Goldreich,et al.  The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Jean-Marc Robert,et al.  How to reduce your enemy's information , 1986, CRYPTO 1986.

[11]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[12]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[13]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  Gilles Brassard,et al.  Experimental Quantum Cryptography , 1990, EUROCRYPT.

[15]  Joel Friedman,et al.  On the bit extraction problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[16]  C. Crépeau,et al.  A quantum bit commitment scheme provably unbreakable by both parties , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[17]  Gilles Brassard,et al.  Secret-Key Reconciliation by Public Discussion , 1994, EUROCRYPT.

[18]  N. Gisin,et al.  Experimental Demonstration of Quantum Cryptography Using Polarized Photons in Optical Fibre over More than 1 km , 1993 .

[19]  P. Townsend.  Secure key distribution system based on quantum cryptography , 1994 .

[20]  U. Maurer.  The Strong Secret Key Rate of Discrete Random Triples , 1994 .

[21]  Martin J. Gander,et al.  On the secret-key rate of binary random variables , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[22]  J. Massey,et al.  An Innnite Class of Counterexamples to a Conjecture concerning Non-linear Resilient Functions , 1995 .

[23]  Douglas R. Stinson,et al.  Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds , 1996, SIAM J. Discret. Math..

[24]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .