(Enter summary)
Abstract: One of the basic problems in cryptography is the generation of a common secret key between two parties, e.g., in order to communicate privately. In this paper we consider information-theoretically secure key agreement. Wyner and subsequently Csiszár and Korner described and analyzed settings for secret-key agreement based on noisy communication channels. Maurer as well as Ahlswede and Csiszár generalized these models to a scenario based on correlated randomness and public... (Update)
Similar documents based on text: More All
0.2: Towards Proving the Existence of "Bound" Information - Renner, Wolf
(Correct)
0.2: Secret-Key Agreement over Unauthenticated Public Channels -.. - Maurer, Wolf (2003)
(Correct)
0.2: About the Mutual (Conditional) Information - Renner, Maurer
(Correct)
BibTeX entry: (Update)
U. Maurer and S. Wolf, Information-theoretic key agreement: from weak to strong secrecy for free, Proceedings of EUROCRYPT 2000, Lecture Notes in Computer Science, Vol. 1807, pp. 352--368, Springer-Verlag, 2000. http://citeseer.ist.psu.edu/maurer00informationtheoretic.html More
@article{ maurer00informationtheoretic,
author = "Ueli Maurer and Stefan Wolf",
title = "Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free",
journal = "Lecture Notes in Computer Science",
volume = "1807",
pages = "351+",
year = "2000",
url = "citeseer.ist.psu.edu/maurer00informationtheoretic.html" }
Citations (may not include all citations):
358
Universal classes of hash functions (context) - Carter, Wegman - 1979
202
Wiley Series in Telecommunications (context) - Cover, Thomas et al. - 1992
85
Construction of a pseudorandom generator from any one-way fu..
- Hastad, Impagliazzo et al. - 1991
84
Privacy amplification by public discussion (context) - Bennett, Brassard et al. - 1988
75
Randomness is linear in space
- Nisan, Zuckerman - 1996
68
Secret key agreement by public discussion from common inform..
- Maurer - 1993
52
The wire-tap channel (context) - Wyner - 1975
48
IEEE Transactions on Information Theory (context) - Bennett, Brassard et al.
46
Construction of Extractors Using Pseudorandom Generators
- Trevisan - 1999
33
Common randomness in information theory and cryptography -- ..
- Ahlswede, Csisz'ar - 1993
21
Broadcast channels with confidential messages (context) - Csisz'ar, Korner - 1978
20
Entropy measures and unconditional security in cryptography
- Cachin - 1997
18
Linking information reconciliation and privacy amplification
- Cachin, Maurer - 1997
14
The strong secret key rate of discrete random triples
- Maurer - 1994
14
Unconditionally secure key agreement and the intrinsic condi..
- Maurer, Wolf - 1999
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.crypto.ethz.ch/~maurer/publications.html): More
Cryptography 2000 ± 10 - Maurer
(Correct)
Perfect Cryptographic Security from Partially Independent Channels - Maurer (1991)
(Correct)
Robustness for Free in Unconditional Multi-Party Computation - Hirt, Maurer (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC