Christian Cachin, Ueli Maurer  Home/Search
Context Related
Links: ACM DBLP | inf.ethz.ch/pub/publication...mem.ps.gz mit.edu/~cc/./papers/mem.ps.gz ibm.com/~cca/papers/mem.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosoft.com/html/secpub (more) From: mit.edu/~cc/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a private-key cryptosystem and a protocol for key agreement by public discussion that are unconditionally secure based on the sole assumption that an adversary's memory capacity is limited. No assumption about her computing power is made. The scenario assumes that a random bit string of length slightly larger than the adversary's memory capacity can be received by all parties. The random bit string can for instance be broadcast by a satellite or over an optical network, or... (Update)
Context of citations to this paper: More
...hence they can safely be used for cryptographic purposes, e.g. as a one time pad for encryption. A sequence of works [Mau92, CM97, AR99, ADR02, DR02, DM02, Lu02] has given increasingly secure and e#cient protocols in this model. In particular, the works of Aumann, Ding, and...
...where the adversary is allowed to compute an arbitrary function of the random string (as described in Section 1. 4) Cachin and Maurer [6] proposed a scheme in which Eve is allowed to access arbitrary s bits of information about R, but the probability that Eve can obtain a non...
Cited by: More
Security Protocols with Isotropic Channels - Madhukar Anand Eric (Correct)
Optimal Randomizer Efficiency in the Bounded-Storage Model - Dziembowski, Maurer (Correct)
Non-Interactive Timestamping In The Bounded Storage Model - Moran, Shaltiel, Ta-Shma (2004) (Correct)
Similar documents (at the sentence level):
62.3%: Entropy Measures and Unconditional Security in Cryptography - Cachin (1997) (Correct)
Active bibliography (related documents): More All
0.8: Smooth Entropy and Rényi Entropy - Cachin (1997) (Correct)
0.6: Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997) (Correct)
0.4: Smoothing Probability Distributions and Smooth Entropy.. - Cachin, al. (1996) (Correct)
Similar documents based on text: More All
0.3: Hyper-Encryption against Space-Bounded Adversaries from On-Line.. - Lu (2002) (Correct)
0.3: Extracting Randomness from Generalized - Symbol-Fixing And Markov (Correct)
0.3: Secure Multi-Party Computation Made Simple - Ueli Maurer Department (Correct)
Related documents from co-citation: More All
8: Conditionally-perfect secrecy and a provably-secure randomized cipher - Maurer - 1992
6: Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989
6: Algorithms for quantum computation: discrete log and factoring - Shor - 1994
BibTeX entry: (Update)
Christian Cachin and Ueli Maurer, Unconditional security against memory-bounded adversaries, Advances in Cryptology: CRYPTO '97 (Burt Kaliski, ed.), Lecture Notes in Computer Science, vol. 1294, Springer-Verlag, 1997, pp. 292--306. http://citeseer.ist.psu.edu/cachin97unconditional.html More
@article{ cachin97unconditional,
author = "Christian Cachin and Ueli M. Maurer",
title = "Unconditional Security Against Memory-Bounded Adversaries",
journal = "Lecture Notes in Computer Science",
volume = "1294",
pages = "292--??",
year = "1997",
url = "citeseer.ist.psu.edu/cachin97unconditional.html" }
Citations (may not include all citations):2319 Elements of Information Theory (context) - Cover, Thomas - 1991 ACM
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
241 Communication theory of secrecy systems (context) - Shannon - 1949
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981 DBLP
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
68 Secret key agreement by public discussion from common inform.. - Maurer - 1993
57 Algorithms for quantum computation: Discrete log and factori.. - Shor - 1994
31 Achieving oblivious transfer using weakened security assumpt.. (context) - Cr'epeau, Kilian - 1989
28 Extracting randomness: How and why --- a survey (context) - Nisan - 1996
24 Conditionally-perfect secrecy and a provably-secure randomiz.. - Maurer - 1992 ACM DBLP
22 On measures of entropy and information (context) - R'enyi - 1961
20 Entropy Measures and Unconditional Security in Cryptography - Cachin - 1997
18 Linking information reconciliation and privacy amplification - Cachin, Maurer - 1997 DBLP
11 Secret-key reconciliation by public discussion - Brassard, Salvail - 1994 ACM DBLP
8 Efficient cryptographic protocols based on noisy channels (context) - Cr'epeau - 1997
8 Smooth entropy and R'enyi entropy - Cachin - 1997
8 Special issue on optical networks (context) - Cruz, Hill et al. - 1996
8 Cryptography (context) - Rivest - 1990 ACM DBLP
6 The Rip van Winkle cipher: A simple and provably computation.. (context) - Massey, Ingemarsson - 1985
4 Pairwise independence and derandomization - Luby, Wigderson - 1995 ACM
3 Contemporary cryptography: An introduction (context) - Massey - 1991
3 25 years of quantum cryptography (context) - Brassard, Cr'epeau - 1996 ACM
3 Personal Communication (context) - Rabin - 1997
2 A storage complexity based analogue of Maurer key establishm.. (context) - Mitchell - 1995 ACM DBLP
1 Satellites for wideband access (context) - Seidman - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (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