Generalized Privacy Amplification

IEEE Transactions on Information Theory

Volumn 41, Issue 6, 1995, Pages 1915-1923

  Bennett, Charles H ^a   Brassard, Gilles ^b   Crépeau, Claude ^c   Maurer, Ueli M ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c CNRS   (France)

^d ETH ZURICH   (Switzerland)

Author keywords

Cryptography; privacy amplification; quantum cryptography; R nyi entropy; secrecy capacity; secret key agreement; unconditional security; universal hashing; wiretap channel

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION RETRIEVAL; RANDOM PROCESSES; SECURITY OF DATA;

PRIVACY AMPLIFICATION; QUANTUM CRYPTOGRAPHY; SECRECY CAPACITY; SECRET KEY AGREEMENT; UNCONDITIONAL SECURITY; UNIVERSAL HASHING; WIRETAP CHANNEL;

CRYPTOGRAPHY;

EID: 0029405656     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.476316     Document Type: Article

References (33)

1. R. Ahlswede and I. Csiszár, “Common randomness in information theory and cryptography—Part I: Secret sharing,” IEEE Trans. Inform. Theory, vol. it-39, pp. 1121–1132, 1993.
2. C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,” J. Cryptol., vol. 5, no. 1, pp. 3–28, 1992.
3. C. H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska, “Practical quantum oblivious transfer,” in Advances in Cryptology — Proceedings of Crypto'91 (Lecture Notes in Computer Science, vol. 576). Berlin, Germany: Springer-Verlag, 1992, pp. 351–366.
4. C. H. Bennett, G. Brassard, and N. D. Mermin, “Quantum cryptography without Bell's theorem,” Phys. Rev. Lett., vol. 68, pp. 557–559, 1992.
5. C. H. Bennett, G. Brassard, and J.-M. Robert, “How to reduce your enemy's information,” in Advances in Cryptology — Proceedings of Crypto'85 (Lecture Notes in Computer Science, vol. 218). Berlin, Germany: Springer-Verlag, 1986, pp. 468–476.
6. —, “Privacy amplification by public discussion,” SIAM J. Comput., vol. 17, no. 2, pp. 210–229, Apr. 1988.
7. J. Bierbrauer, K. Gopalakrishnan, and D. R. Stinson, “Orthogonal arrays, resilient functions, error correcting codes and linear programming bounds,” to appear in SIAM J. Discr. Math., 1994.
8. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
9. G. Brassard, “Cryptology column—Quantum cryptography: A bibliography,” Sigact News, vol. 24, no. 3, pp. 16–20, 1993.
10. G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, “A quantum bit commitment scheme provably unbreakable by both parties,” in Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 362–371.
11. G. Brassard and L. Salvail, “Secret-key reconciliation by public discussion,” in Advances in Cryptology-Proc. Eurocrypt'93 (Lecture Notes in Computer Science, vol. 765). Germany: Springer Verlag, Berlin, 1994, pp. 410–423.
12. C. Cachin and U. M. Maurer, “Linking information reconciliation and privacy amplification,” J. Cryptol., to appear.
13. J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” J. Comput. Syst. Sci., vol. 18, pp. 143–154, 1979.
14. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich, and R. Smolensky, “The bit extraction problem or t-resilient functions,” in Proc. 26th IEEE Symp. on Foundations of Computer Science, Oct. 1985, pp. 396–407.
15. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
16. —, “Broadcast channels with confidential messages,” IEEE Trans. Inform. Theory, vol. IT-24, no. 3, pp. 339–348, 1978.
17. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 644–654, 1976.
18. J. Friedman, “On the bit extraction problem,” in Proc. 33rd IEEE Symp. on Foundations of Computer Science, Oct. 1992, pp. 314–319.
19. R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudo-random generation from one-way functions,” in Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 12–24.
20. R. Impagliazzo and D. Zuckerman, “How to recycle random bits,” in Proc. 30th IEEE Symp. on Foundations of Computer Science, Oct. 1989, pp. 248–253.
21. V. Korzhik and V. Yakovlev, “Nonasymptotic estimates of information protection efficiency for the wire-tap channel concept,” in Advances in Cryptology-Proceedings of Auscrypt'92 (Lecture Notes in Computer Science, vol. 718). Germany: Springer-Verlag, Berlin, 1993, pp. 185–195.
22. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
23. C. Marand and P. D. Townsend, “Quantum key distribution over distances up to 30 km,” Opt. Lett., vol. 20, May 15, 1995.
24. U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Trans. Inform. Theory, vol. 39, pp. 733–742, 1993.
25. —, “The strong secret key rate of discrete random triples,” in Communications and Cryptography, Two Sides of one Tapestry, R.E. Blahut et al. Eds. Norwell, MA: Kluwer, 1994, pp. 271–285.
26. A. Muller, J. Breguet, and N. Gisin, “Experimental demonstration of quantum cryptography using polarized photons in optical fiber over more than 1 km,” Europhys. Lett., vol. 23, no. 6.20 pp. 383–388, Aug. 1993.
27. A. Rényi, “On measures of entropy and information,” in Proc. 4th Berkeley Symp. on Mathematical Statistics and Probability, vol. 1, 1961, pp. 547–561.
28. C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.
29. D. R. Stinson and J. L. Massey, “An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions,” J. Cryptol., vol. 8, no. 3, to appear.
30. P. D. Townsend, “Secure key distribution system based on quantum cryptography,” Electron. Lett., vol. 30, no. 10, pp. 809–810, May 12, 1994.
31. G. S. Vernam, “Cipher printing telegraph systems for secret wire and radio telegraphic communications,” J. Amer. Inst. Elec. Eng., vol. 55, pp. 109–115, 1926.
32. M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality,” J. Comput. Syst. Sci., vol. 22, pp. 265–279, 1981.
33. A. D. Wyner, “The wire-tap channel,” Bell Syst. Techn. J., vol. 54, no. 8, pp. 1355–1387, 1975.