43 search results - page 1 / 9 » On Basing Private Information Retrieval on NP-Hardness |
ACISP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
ESORICS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The ubiquity of smartphones and other location-aware handheld devices has resulted in a dramatic increase in popularity of locationbased services (LBS) tailored to user l...
ECCC
2006
13 years 4 months ago
2006
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...