406 search results - page 11 / 82 » Pseudorandomness and Combinatorial Constructions |
TCC
2005
Springer
15 years 4 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 ...
IACR
2011
13 years 10 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
62
Voted
CRYPTO
2003
Springer
15 years 4 months ago
2003
Springer
We give two applications of Nisan–Wigderson-type (“non-cryptographic”) pseudorandom generators in cryptography. Specifically, assuming the existence of an appropriate NW-ty...
APPROX
2009
Springer
15 years 5 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
EUROCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...