Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai  Home/Search
Context Related
| mit.edu/~amits/work/CDHKS00.ps 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: mit.edu/~amits/work/index (more) Homepages: A.Sahai |
Rate this article:      (best)Comment on this article |
Abstract: In this work, we study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key is compromised. We show how to build cryptographic primitives, in the standard model (without random oracles), that remain secure even when an adversary is able to learn almost all of the secret key. We accomplish this by giving constructions for the All-Or-Nothing Transform (AONT), introduced by Rivest. An AONT... (Update)
Cited by: More
A Note on Bounded Chosen Ciphertext Security from.. - Cramer, Hofheinz, Kiltz (2006) (Correct)
Partial Key-Hiding in RSA - Fhloinn, Purser (2005) (Correct)
Key Derivation and Randomness Extraction - Chevassut, Fouque, Gaudry.. (2005) (Correct)
Similar documents (at the sentence level):
52.7%: Exposure-Resilient Functions and All-Or-Nothing.. - Canetti, Dodis, Halevi, .. (2000) (Correct)
19.6%: Exposure-Resilient Cryptography - Dodis (2000) (Correct)
Active bibliography (related documents): More All
0.2: A Comparative Study of Software Protection Tools Suited for.. - Hachez (2003) (Correct)
0.2: On Perfect and Adaptive Security in Exposure-Resilient.. - Dodis, Sahai, Smith (2001) (Correct)
0.2: Certifying Cryptographic Algorithms - Using The Coq (Correct)
Similar documents based on text: More All
0.7: A New Mode of Using All-Or-Nothing Transforms - Canda, van Trung (Correct)
0.4: A Forward-Secure Public-Key Encryption Scheme - Canetti, Halevi, Katz (2003) (Correct)
0.3: Chosen-Ciphertext Security from Identity-Based Encryption - Canetti, Halevi, Katz (2004) (Correct)
Related documents from co-citation: More All
8: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciph.. - Cramer, Shoup - 1998
6: Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
6: Coding constructions for blacklisting problems without computational assumptions - Kumar, Rajagopalan et al. - 1999
BibTeX entry: (Update)
R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and allor -nothing transforms. In B. Preneel, editor, Advances in Cryptology -- EUROCRYPT ' 2000, volume 1807 of Lecture Notes in Computer Science, pages 453--469. Springer-Verlag, May 2000. http://citeseer.ist.psu.edu/article/canetti00exposureresilient.html More
@article{ canetti00exposureresilient,
author = "Ran Canetti and Yevgeniy Dodis and Shai Halevi and Eyal Kushilevitz and Amit Sahai",
title = "Exposure-Resilient Functions and All-or-Nothing Transforms",
journal = "Lecture Notes in Computer Science",
volume = "1807",
pages = "453+",
year = "2000",
url = "citeseer.ist.psu.edu/article/canetti00exposureresilient.html" }
Citations (may not include all citations):860 Theory of Error-Correcting Codes (context) - MacWilliams, Sloane - 1981
645 How to share a secret (context) - Shamir - 1979
193 Threshold Cryptosystems (context) - Desmedt, Frankel - 1989
167 Pseudo-random Generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
138 Small-Bias Probability Spaces: Efficient Constructions and A.. - Naor, Naor - 1993
81 The Bit Extraction Problem or t-resilient Functions - Chor, Friedman et al. - 1985
73 A Forward-Secure Digital Signature Scheme - Bellare, Miner - 1999
60 Computing with Very Weak Random Sources - Srinivasan, Zuckerman - 1994
52 Foundations of Cryptography - Goldreich
46 Construction of Extractors Using Pseudo-Random Generators - Trevisan - 1999
42 All-or-Nothing Encryption and the Package Transform - Rivest - 1997
40 Tiny Families of Functions with Random Properties: A Quality.. - Goldreich, Wigderson - 1994
30 A Pseudorandom generator from any one-way function (context) - Hastad, Impagliazzo et al. - 1989
30 Secret Sharing Made Short (context) - Krawczyk - 1993
28 Extracting Randomness: How and Why A survey (context) - Nisan - 1996
19 Generalized Privacy Amplification - Bennett, Brassard et al. - 1995
19 Error Reduction for Extractors - Raz, Reingold et al. - 1999
19 A Note on Computational Indistinguishability - Goldreich - 1990
18 Linking information reconciliation and privacy amplification - Cachin, Maurer - 1997
13 the Security Properties of the OAEP as an All-or-Nothing Tra.. (context) - Boyko - 1999
11 Safeguarding Cryptographic Keys (context) - Blackley - 1979
9 Encrypt Small (context) - Jakobsson, Stern et al. - 1999
6 hide and seek (context) - Shamir, Someren - 1999
6 New Viruses Search For Strong Encryption Keys (context) - Dornan - 1999
5 Optimal Asymetric Encryption (context) - Bellare, Rogaway - 1995
3 Proactive public key and signature schemes (context) - Hertberg, Jackobson et al. - 1997
1 Some observations on all-or-nothing transforms - Stinson - 1998
1 How not to authenticate code (context) - Someren - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~amits/work/index.html): More
Concurrent Zero-Knowledge - Dwork, Naor, Sahai (1999) (Correct)
Honest-Verifier Statistical Zero-Knowledge Equals.. - Goldreich, Sahai, Vadhan (1998) (Correct)
Concurrent Zero-Knowledge: Reducing the Need for Timing.. - Dwork, Sahai (1998) (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