406 search results - page 2 / 82 » Pseudorandomness and Combinatorial Constructions |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
CCS
2009
ACM
13 years 9 months ago
2009
ACM
In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom
FSE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
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...
CRYPTO
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...