(Enter summary)
Abstract: Unconditional cryptographic security cannot be generated
simply from scratch, but must be based on some given primitive to start
with (such as, most typically, a private key). Whether or not this implies
that such a high level of security is necessarily impractical depends on
how weak these basic primitives can be, and how realistic it is therefore
to realize or
nd them in|classical or quantum|reality. A natural way
of minimizing the required resources for information-theoretic security... (Update)
Cited by: More
Lightweight Key Exchange and Stream Cipher Based Solely on.. - Volkmer, Wallner (2005)
(Correct)
Tree Parity Machine Rekeying Architectures for Embedded Security - Volkmer, Wallner (2005)
(Correct)
The Exact Price for Unconditionally Secure Asymmetric.. - Renner, Wolf (2004)
(Correct)
Active bibliography (related documents): More All
2.9: Unconditional Authenticity and Privacy from an Arbitrarily.. - Renner, Wolf (2003)
(Correct)
0.8: Secret-Key Agreement over Unauthenticated Public Channels -.. - Maurer, Wolf (2003)
(Correct)
0.6: Secret-Key Agreement over Unauthenticated Public Channels -.. - Maurer, Wolf (2003)
(Correct)
Similar documents based on text: More All
0.6: Universally Composable Privacy Amplification against Quantum.. - Renner, König (2004)
(Correct)
0.4: New Bounds in Secret-Key Agreement: The Gap Between Formation.. - Renner, Wolf (2003)
(Correct)
0.4: Towards Proving the Existence of "Bound" Information - Renner, Wolf (2002)
(Correct)
Related documents from co-citation: More All
2: Entropy Measures and Unconditional Security in Cryptography
- Cachin - 1997
2: on Security in Pervasive Computing (context) - Stajano - 2003
2: Pervasive Computing Goes the Last Hundred Feet with RFID Systems (context) - Stanford - 2003
BibTeX entry: (Update)
R. Renner and S. Wolf, Unconditional authenticity and privacy from an arbitrarily weak secret and completely insecure communication, Advances in Cryptology - CRYPTO 2003, LNCS, Vol. 2729, pp. 78-95, Springer-Verlag, 2003. http://citeseer.ist.psu.edu/renner03unconditional.html More
@misc{ renner03unconditional,
author = "R. Renner and S. Wolf",
title = "Unconditional authenticity and privacy from an arbitrarily weak secret
and completely insecure communication",
text = "R. Renner and S. Wolf, Unconditional authenticity and privacy from an arbitrarily
weak secret and completely insecure communication, Advances in Cryptology
- CRYPTO 2003, LNCS, Vol. 2729, pp. 78-95, Springer-Verlag, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/renner03unconditional.html" }
Citations (may not include all citations):
1749
An introduction to probability theory and its applications (context) - Feller - 1968
241
Communication theory of secrecy systems (context) - Shannon - 1949
90
Quantum cryptography: public key distribution and coin tossi.. (context) - Bennett, Brassard - 1984
68
Secret key agreement by public discussion from common inform..
- Maurer - 1993
52
The wire-tap channel (context) - Wyner - 1975
47
Extracting all the randomness and reducing the error in Trev..
- Raz, Reingold et al. - 1999
24
Conditionally-perfect secrecy and a provably-secure randomiz..
- Maurer - 1992
20
Entropy measures and unconditional security in cryptography
- Cachin - 1997
19
Error reduction for extractors
- Raz, Reingold et al. - 1999
15
Information-theoretically and computationally secure key agr.. (context) - Wolf - 1999
14
Everlasting security in the bounded storage model (context) - Aumann, Ding et al. - 2002
14
Secret-key agreement over unauthenticated public channels { ..
- Maurer, Wolf - 2003
14
Secret-key agreement over unauthenticated public channels { ..
- Maurer, Wolf - 2003
14
Secret-key agreement over unauthenticated public channels { ..
- Maurer, Wolf - 2003
14
Privacy ampli cation by public discussion (context) - Bennett, Brassard et al. - 1988
13
Advances in Cryptology - CRYPTO (context) - Stinson, hashing et al. - 1992
13
Codes for interactive authentication
- Gemmell, Naor - 1993
9
How to fool an unbounded adversary with a short key (context) - Russell, Wang - 2002
9
Tight security proofs for the bounded-storage model
- Dziembowski, Maurer - 2002
8
Broadcast channels with con dential messages (context) - Csisz, orner - 1978
7
the impossibility of private key cryptography with weakly ra.. (context) - McInnes, Pinkas - 1990
7
Strong security against active attacks in information-theore..
- Wolf - 1998
6
universality of the one-time pad (context) - Dodis, Spencer et al. - 2002
5
Generalized privacy ampli cation (context) - Bennett, Brassard et al. - 1995
4
personal communication (context) - Holenstein, Maurer et al.
2
Privacy ampli cation secure against active adversaries (context) - Maurer, Wolf - 1997
Documents on the same site (http://www.crypto.ethz.ch/~renner/publications.html): More
Bound Information: The Classical Analog to Bound Quantum.. - Gisin, Renner, Wolf
(Correct)
New Bounds in Secret-Key Agreement: The Gap Between Formation.. - Renner, Wolf (2003)
(Correct)
Towards Proving the Existence of "Bound" Information - Renner, Wolf
(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