Linking information reconciliation and privacy amplification

Journal of Cryptology

Volumn 10, Issue 2, 1997, Pages 97-110

  Cachin, Christian ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Entropy; Information reduction; Privacy amplification; Quantum cryptography; Reconciliation; R nyi; Secret key agreement; Unconditional security

Indexed keywords

EID: 0001777508     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900023     Document Type: Article

References (13)

1. C.'H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, Experimental quantum cryptography Journal ofCryptology, vol. 5, no. 1, pp. 3-28, 1992.
2. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, Generalized privacy amplification, IEE Transactions on Information Theory, vol. 41, pp. 1915-1923, Nov. 1995.
3. C. H. Bennett, G. Brassard, and J.-M. Robert, Privacy amplification by public discussion, SIAM Journa on Computing, vol. 17, pp. 210-229, April 1988
4. R. E. Blahut, Principles and Practice of Information Theory. Addison-Wesley, Reading, MA, 1987.
5. G. Brassard, A quantum jump in computer science, In: Computer Science Today (J. van Leeuwen, ed.) Lecture Notes in Computer Science, vol. 1000, pp. 1-14, Springer-Verlag, New York, 1995.
6. G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, In: Advances in Cryptology EUROCRYPT '93 (T. Helleseth, ed.), Lecture Notes in Computer Science, vol. 765, pp. 410-423 Springer-Verlag, New York, 1994.
7. J. L. Carter and M. N. Wegman, Universal classes of hash functions. Journal of Computer and Syste Sciences, vol. 18, pp. 143-154, 1979
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, New York, 1991.
9. W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory vol. 22, pp. 644-654, Nov. 1976.
10. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Transaction on Information Theory, vol. 39, pp. 733-742, May 1993.
11. U. M. Maurer, The strong secret key rate of discrete random triples, In: Communications and Cryptog raphy: Two Sides of One Tapestry (R. E. Blahut et al., eds.), Kluwer, Amsterdam, 1994.
12. A. Rényi, On measures of entropy and information. In: Proc. 4th Berkeley Symposium on Mathematica and Statistical Probability, vol. 1 (Berkeley), pp. 547-561, University of California Press, Berkeley, CA 1961.
13. P. W. Shor, Algorithms for quantum computation: Discrete logarithm and factoring, In: Proc. 35th IEE Symposium on Foundations of Computer Science (FOCS), pp. 124-134, 1994.