Abstract
Information reconciliation and privacy amplification are important tools in cryptography and information theory. Reconciliation allows two parties knowing correlated random variables, such as a noisy version of the partner's random bit string, to agree on a shared string. Privacy amplification allows two parties sharing a partially secret string, about which an opponent has some partial information, to distill a shorter but almost completely secret key by communicating only over an insecure channel, as long as an upper bound on the opponent's knowledge about the string is known. The relation between these two techniques has not been well understood and it is the purpose of this paper to provide the missing link between these techniques. The results have applications in unconditionally secure key agreement protocols and in quantum cryptography.
This research was supported by the Swiss National Science Foundation. The full version of this paper has been submitted to the Journal of Cryptology.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, “Experimental quantum cryptography,” Journal of Cryptology, vol. 5, no. 1, pp. 3–28, 1992.
C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, “Generalized privacy amplification.” Preprint, 1994.
C. H. Bennett, G. Brassard, and J.-M. Robert, “Privacy amplification by public discussion,” SIAM Journal on Computing, vol. 17, pp. 210–229, Apr. 1988.
E. Bernstein and U. Vazirani, “Quantum complexity theory,” in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 11–20, 1993.
R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
G. Brassard and L. Salvail, “Secret-key reconciliation by public discussion,” in Advances in Cryptology — EUROCRYPT '93 (T. Helleseth, ed.), vol. 765 of Lecture Notes in Computer Science, pp. 410–423, Springer-Verlag, 1994.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” Journal of Computer and System Sciences, vol. 18, pp. 143–154, 1979.
W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, pp. 644–654, Nov. 1976.
S. Lloyd, “A potentially realizable quantum computer,” Science, vol. 261, pp. 1569–1571, 1993.
U. M. Maurer, “Secret key agreement by public discussion from common information,” IEEE Transactions on Information Theory, vol. 39, pp. 733–742, May 1993.
U. M. Maurer, “The strong secret key rate of discrete random triples,” in Communications and Cryptography: Two Sides of One Tapestry (R. E. Blahut et al., eds.), Kluwer, 1994.
P. W. Shor, “Algorithms for quantum computation.” Submitted to FOCS'94, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cachin, C., Maurer, U.M. (1995). Linking information reconciliation and privacy amplification. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053442
Download citation
DOI: https://doi.org/10.1007/BFb0053442
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive