Information-theoretic key agreement: From weak to strong secrecy for free

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1807, Issue , 2000, Pages 351-368

  Maurer, Ueli ^a   Wolf, Stefan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

AMOUNT OF INFORMATION; INFORMATION-THEORETIC KEY AGREEMENTS; KEY AGREEMENT; KEY GENERATION RATE; PRIVACY REQUIREMENTS; SCENARIO-BASED; SECRET KEY AGREEMENT; STRONG SECRECIES;

CRYPTOGRAPHY;

EID: 84948960386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_24     Document Type: Conference Paper

References (18)

1. R. Ahlswede and I. Csiszár, Common randomness in information theory and cryptography - Part I: secret sharing, IEEE Transactions on Information Theory, Vol. 39, No. 4, pp. 1121-1132, 1993.
2. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, Generalized privacy amplification, IEEE Transactions on Information Theory, Vol. 41, No. 6, pp. 1915-1923, 1995.
3. C. H. Bennett, G. Brassard, and J.-M. Robert, Privacy amplification by public discussion, SIAM Journal on Computing, Vol. 17, pp. 210-229, 1988.
4. G. Brassard and L. Salvail, Secret-key reconciliation by public discussion, Advances in Cryptology - EUROCRYPT ’93, Lecture Notes in Computer Science, Vol. 765, pp. 410-423, Springer-Verlag, 1994.
5. C. Cachin, Entropy measures and unconditional security in cryptography, Ph. D. Thesis, ETH Zurich, Hartung-Gorre Verlag, Konstanz, 1997.
6. C. Cachin and U. M. Maurer, Linking information reconciliation and privacy amplification, Journal of Cryptology, Vol. 10, No. 2, pp. 97-110, 1997.
7. J. L. Carter and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences, Vol. 18, pp. 143-154, 1979.
8. T. M. Cover and J. A. Thomas, Elements of information theory, Wiley Series in Telecommunications, 1992.
9. I. Csiszár, Almost independence and secrecy capacity (in Russian), in Problems of Information Transmission (PPI), Vol. 32, No. 1, pp. 48-57, 1996.
10. I. Csiszár and J. Körner, Broadcast channels with confidential messages, IEEE Transactions on Information Theory, Vol. 24, No. 3, pp. 339-348, 1978.
11. N. Gisin and S. Wolf, Linking classical and quantum key agreement: is there “bound information”?, manuscript, 2000.
12. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, ICSI Tech. Rep. 91-068, 1991.
13. U. M. Maurer, Secret key agreement by public discussion from common information, IEEE Transactions on Information Theory, Vol. 39, No. 3, pp. 733-742, 1993.
14. U. M. Maurer, The strong secret key rate of discrete random triples, in Communication and Cryptography - Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271-285, 1994.
15. U. M. Maurer and S. Wolf, Unconditionally secure key agreement and the intrinsic conditional information, IEEE Transactions on Information Theory, Vol. 45, No. 2, pp. 499-514, 1999.
16. L. Trevisan, Construction of Extractors Using Pseudorandom Generators, Proc. Of the 31st Symposium on Theory of Computing (STOC), ACM, pp. 141-148, 1999.
17. S. P. Vadhan, Extracting all the randomness from a weakly random source, Electronic Colloquium on Computational Complexity, Tech. Rep. TR98-047, 1998.
18. A. D. Wyner, The wire-tap channel, Bell System Technical Journal, Vol. 54, No. 8, pp. 1355-1387, 1975.