Functions Thomas Holenstein, Ueli Maurer, and Johan Sjodin...  Home/Search
Context
Related
| inf.ethz.ch/pub/crypto/pu...HoMaSj04.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: crypto.ethz.ch/~ma...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let f : be a one-way function. A function is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from , it is computationally infeasible to distinguish h(x) from a uniformly random m-bit string. A (randomized) function h : is a general hard-core function if it is hard-core for every one-way function f : , where the second input to h is a k-bit uniform random string r. Hard-core functions are a crucial tool in... (Update)
Similar documents based on text: More All
0.2: Unconditionally Secure Key Agreement and the Intrinsic.. - Maurer, Wolf (1999) (Correct)
0.2: Efficient Secure Multi-Party Computation - Hirt, Maurer, Przydatek (2000) (Correct)
0.2: Robustness for Free in Unconditional Multi-Party Computation - Hirt, Maurer (2001) (Correct)
BibTeX entry: (Update)
@misc{ holenstein-complete,
author = "Functions Thomas Holenstein",
title = "Complete Classification of Bilinear Hard-Core",
url = "citeseer.ist.psu.edu/702296.html" }
Citations (may not include all citations):339 Theory and applications of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
90 A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
68 One-way functions and pseudorandom generators (context) - Levin - 1987
65 Learning polynomials with queries: The highly noisy case - Goldreich, Rubinfeld et al. - 2000
64 Pseudorandom generators without the XOR lemma - Sudan, Trevisan et al. - 2001
62 RSA and Rabin functions: Certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988
54 Cambridge University Press (context) - Goldreich, Foundations - 2001
5 ciency of generic cryptographic constructions (context) - Gennaro, Trevisan et al. - 2000
5 Universal hash functions & hard core bits - Naslund - 1995
2 All bits in ax + b mod p are hard (context) - Naslund - 1996
1 ACM Special Interest Group on Automata and Computability The.. (context) - Sudan, Algorithms et al. - 2000
1 Proving hard-core predicates using list decoding (context) - Akavia, Goldwasser et al. - 2003
[Article contains additional citations not shown here]
Documents on the same site (http://www.crypto.ethz.ch/~maurer/publications.html): More
Cryptography 2000 ± 10 - Maurer (Correct)
Perfect Cryptographic Security from Partially Independent Channels - Maurer (1991) (Correct)
Robustness for Free in Unconditional Multi-Party Computation - Hirt, Maurer (2001) (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