45 search results - page 1 / 9 » On Constructing Parallel Pseudorandom Generators from One-Wa... |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
STOC
2010
ACM
13 years 8 months ago
2010
ACM
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
EUROCRYPT
2010
Springer
13 years 9 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
CC
2005
Springer
13 years 4 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...