Sciweavers

80 search results - page 14 / 16
» Constant-Round Private Database Queries
Sort
View
104
Voted
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 5 days ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
FOCS
2010
IEEE
14 years 9 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum
92
Voted
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
15 years 4 months ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
251
Voted

Tutorial
2179views
16 years 11 months ago
Privacy in Location-Based Services: State-of-the-Art and Research Directions
The explosive growth of location-detection devices (e.g., GPS-like devices and handheld devices) along with wireless communications and mobile databases results in realizing locati...
Mohamed F. Mokbel
SIGMOD
2011
ACM
283views Database» more  SIGMOD 2011»
14 years 2 months ago
iReduct: differential privacy with reduced relative errors
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...
Xiaokui Xiao, Gabriel Bender, Michael Hay, Johanne...