397 search results - page 5 / 80 » Pseudorandom Functions and Lattices |
CC
2005
Springer
14 years 9 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...
66
Voted
IACR
2011
13 years 9 months ago
2011
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....
TCC
2005
Springer
15 years 2 months ago
2005
Springer
We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are ...
98
Voted
TIT
2010
14 years 4 months ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
87
Voted
SIAMREV
2010
14 years 4 months ago
2010
A survey of different representations for lattice sums for the Helmholtz equation is given. These sums arise naturally when dealing with wave scattering by periodic structures. One...