Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai  Home/Search
Context Related
| ibm.com/security/cdhks.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: ibm.com/security/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 that remain secure even when an adversary is able to learn almost all of the secret key. (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):
61.4%: Exposure-Resilient Functions and All-Or-Nothing.. - Canetti, Dodis, Halevi, .. (2000) (Correct)
25.0%: Exposure-Resilient Cryptography - Dodis (2000) (Correct)
Active bibliography (related documents): More All
0.4: On Perfect and Adaptive Security in Exposure-Resilient.. - Dodis, Sahai, Smith (2001) (Correct)
0.3: Securing Bulk Content Almost for Free - Byers, Considine, Itkis, Cheng.. (2004) (Correct)
0.2: A Comparative Study of Software Protection Tools Suited for.. - Hachez (2003) (Correct)
Similar documents based on text: More All
0.4: A Cryptographic Solution to a Game Theoretic Problem - Dodis, Halevi, Rabin (Correct)
0.3: A Study of Secure Database Access and General Two-Party Computation - Malkin (2000) (Correct)
0.3: Incremental Codes - Dodis, Halevi (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/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/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
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
167 Pseudorandom Generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
138 Small-Bias Probability Spaces: Efficient Constructions and A.. - Naor, Naor - 1993
90 A Pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1989
81 The Bit Extraction Problem or t-resilient Functions - Chor, Friedman et al. - 1985
73 A Forward-Secure Digital Signature Scheme - Bellare, Miner - 1999
64 Codes and Cryptography (context) - Diffie, van Oorschot et al. - 1992
60 Computing with Very Weak Random Sources - Srinivasan, Zuckerman - 1994
46 Construction of Extractors Using PseudoRandom Generators - Trevisan - 1999
42 All-or-Nothing Encryption and the Package Transform - Rivest - 1997
30 Secret Sharing Made Short (context) - Krawczyk - 1993
28 The Random-Oracle Model (context) - Canetti, Goldreich et al. - 1998
19 Error Reduction for Extractors - Raz, Reingold et al. - 1999
19 A Note on Computational Indistinguishability - Goldreich - 1990
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
7 Something About All or Nothing (context) - Stinson - 1999
6 New Viruses Search For Strong Encryption Keys (context) - Dornan - 1999
6 hide and seek (context) - Shamir, van Someren - 1999
5 How not to authenticate code (context) - van Someren - 1998
5 Optimal Asymetric Encryption (context) - Bellare, Rogaway - 1995
5 Hash functions and the MAC using all-or-nothing property (context) - Shin, Rhee - 1999
http://www.wisdom.weizmann.ac.il/home/oded/public
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.ibm.com/security/publ.html): More
Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1999) (Correct)
UMAC: Fast and Secure Message Authentication - Black, Halevi, Krawczyk.. (1999) (Correct)
Efficient Commitment Schemes with Bounded Sender and Unbounded.. - Halevi (1996) (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