Oded Goldreich  Home/Search
Context
Related
| iacr.org/2000/001.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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many of the results in Modern Cryptography are actually transformations of a basic computational phenomenon (i.e., a basic primitive, tool or assumption) to a more complex phenomenon (i.e., a higher level primitive or application). The transformation is explicit and is always accompanied by an explicit reduction of the violation of the security of the former phenomenon to the violation of the latter. A key aspect is the efficiency of the reduction. We discuss and slightly modify the... (Update)
Similar documents (at the sentence level):
9.8%: The Foundations of Modern Cryptography - Goldreich (1997) (Correct)
6.2%: Zero-Knowledge twenty years after its invention - Goldreich (2002) (Correct)
Active bibliography (related documents): More All
0.1: A Pseudorandom Generator from any One-way Function - Håstad, Impagliazzo, Levin.. (1999) (Correct)
0.1: Learning Polynomials With Queries: The Highly Noisy Case - Goldreich, Rubinfeld, Sudan (1995) (Correct)
0.1: Power from Random Strings - Allender, Koucky, Ronneburger (2001) (Correct)
Similar documents based on text: More All
0.3: Session-Key Generation using Human Passwords Only - Goldreich, Lindell (2000) (Correct)
0.3: On the Security of Modular Exponentiation with Application.. - Goldreich, Rosen (2000) (Correct)
0.3: On the Limits of Non-Approximability of Lattice Problems - Goldreich, Goldwasser (1998) (Correct)
BibTeX entry: (Update)
@techreport{ goldreich00security,
author = "Oded Goldreich",
title = "On Security Preserving Reductions -- Revised Terminology",
number = "2000/001",
year = "2000",
url = "citeseer.ist.psu.edu/article/goldreich00security.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
501 A Digital Signature Scheme Secure Against Adaptive Chosen-Me.. - Goldwasser, Micali et al. - 1988
419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
339 Theory and Application of Trapdoor Functions (context) - Yao - 1982
334 How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1984
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
68 One-Way Function and Pseudorandom Generators (context) - Levin - 1987
60 Hard-core Predicates for any One-Way Function (context) - Goldreich, Levin - 1989
40 Foundation of Cryptography -- Fragments of a Book - Goldreich - 1995
36 Security Preserving Amplification of Hardness - Goldreich, Impagliazzo et al. - 1990
9 Algorithms and Combinatorics series (context) - Goldreich, Probabilistic et al. - 1998
8 Randomness and Non-determinism (context) - Levin - 1993
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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