Oded Goldreich, Russell Impagliazzo, Leonid Levin, Ramarathnam Venkatesan, David Zuckerman  @ NUS Home/Search
Context Related
| mit.edu/pub/people/oded/gilvz.ps utexas.edu/users/diz/security.ps wisdom.weizmann.ac.il/pub/od...gilvz.ps Cached: PS.gz PS PDF Image Update Help From: cryptosoft.com/html/secpub (more) From: fermivista.math....weizmann.ac.il (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the task of transforming a weak one-way function (which may be easily inverted on all but a polynomial fraction of the range) into a strong one-way function (which can be easily inverted only on a negligible fraction of the range). The previous known transformation [Yao 82] does not preserve the security (i.e., the running-time of the inverting algorithm) within any polynomial. Its resulting function F (x) applies the weak oneway function to many small (of length jxj " , " ! 1)... (Update)
Cited by: More
Candidate One-Way Functions and One-Way Permutations Based on.. - Gligoroski (2005) (Correct)
Perfect Zero-Knowledge Arguments for NP Can Be Based .. - Naor, Ostrovsky.. (1992) (Correct)
On Security Preserving Reductions - Revised Terminology - Goldreich (2000) (Correct)
Active bibliography (related documents): More All
0.0: On Metric Ramsey-Type Phenomena - Bartal, Linial, Mendel (Correct)
0.0: Normalized Cuts and Image Segmentation - Shi, Malik (1997) (Correct)
0.0: Expanders that Beat the Eigenvalue Bound: Explicit.. - Wigderson, Zuckerman (1993) (Correct)
Similar documents based on text: More All
0.2: Oneway Permutations in NC^0 - Håstad (Correct)
0.2: A CORBA-Based Object Group Service and a Join Service.. - Aleksy, Korthaus (2000) (Correct)
0.2: Implementation Techniques and an Object Group Service for.. - Aleksy, Korthaus (2000) (Correct)
Related documents from co-citation: More All
15: Theory and Applications of Trapdoor Functions (context) - Yao - 1982
14: How to generate cryptographically strong sequences of pseudorandom bits (context) - Blum, Micali - 1984
12: Deterministic simulation in logspace (context) - Ajtai, Koml'os et al. - 1987
BibTeX entry: (Update)
O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan and D. Zuckerman, "Security Preserving Amplification of Hardness", 31st FOCS, 1990, pp. 318--326. http://citeseer.comp.nus.edu.sg/19560.html More
@misc{ goldreich90security,
author = "O. Goldreich and R. Impagliazzo and L. Levin and R. Venkatesan and D. Zuckerman",
title = "Security Preserving Amplification of Hardness",
text = "O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan and D. Zuckerman,
Security Preserving Amplification of Hardness, 31st FOCS, 1990, pp. 318--326.",
year = "1990",
url = "citeseer.comp.nus.edu.sg/19560.html" }
Citations (may not include all citations):126 Eigenvalues and Expanders (context) - Alon - 1986
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 at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.