Sciweavers

397 search results - page 5 / 80
» Pseudorandom Functions and Lattices
Sort
View
CC
2005
Springer
118views System Software» more  CC 2005»
13 years 6 months ago
The complexity of constructing pseudorandom generators from hard functions
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...
Emanuele Viola
IACR
2011
92views more  IACR 2011»
12 years 6 months ago
From Non-Adaptive to Adaptive Pseudorandom Functions
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....
Iftach Haitner, Itay Berman
TCC
2005
Springer
95views Cryptology» more  TCC 2005»
14 years 14 days ago
Keyword Search and Oblivious Pseudorandom Functions
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 ...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Om...
TIT
2010
130views Education» more  TIT 2010»
13 years 1 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
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...
Palash Sarkar
SIAMREV
2010
94views more  SIAMREV 2010»
13 years 1 months ago
Lattice Sums for the Helmholtz Equation
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...
Chris M. Linton