Sciweavers

80 search results - page 6 / 16
» Constant-Round Private Database Queries
Sort
View
CCS
2004
ACM
15 years 2 months ago
Private inference control
Access control can be used to ensure that database queries pertaining to sensitive information are not answered. This is not enough to prevent users from learning sensitive inform...
David P. Woodruff, Jessica Staddon
EDBT
2008
ACM
131views Database» more  EDBT 2008»
15 years 9 months ago
A Bayesian approach for on-line max and min auditing
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
Gerardo Canfora, Bice Cavallo
ICALP
2005
Springer
15 years 3 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
ICDE
2009
IEEE
180views Database» more  ICDE 2009»
15 years 11 months ago
Outsourcing Search Services on Private Spatial Data
Social networking and content sharing service providers, e.g., Facebook and Google Maps, enable their users to upload and share a variety of user-generated content, including locat...
Man Lung Yiu, Gabriel Ghinita, Christian S. Jensen...
ECCC
2006
120views more  ECCC 2006»
14 years 9 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin