Sciweavers

13 search results - page 1 / 3
» Efficiency Improvements in Constructing Pseudorandom Generat...
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 9 months ago
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
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 ...
Iftach Haitner, Omer Reingold and Salil Vadhan
EUROCRYPT
2010
Springer
13 years 9 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
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...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
CCS
2010
ACM
13 years 5 months ago
Algebraic pseudorandom functions with improved efficiency from the augmented cascade
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...
Dan Boneh, Hart William Montgomery, Ananth Raghuna...
ASIACRYPT
2001
Springer
13 years 9 months ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund