24 search results - page 3 / 5 » Hardness Preserving Constructions of Pseudorandom Functions |
EUROCRYPT
2010
Springer
14 years 9 days 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...
TIT
2008
13 years 7 months ago
2008
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
TC
2010
13 years 2 months ago
2010
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...