DiApprox: Differential Privacy-based Online Range Queries Approximation for Multidimensional Data
Abstract
References
Index Terms
- DiApprox: Differential Privacy-based Online Range Queries Approximation for Multidimensional Data
Recommendations
Answering n{2+o(1)} counting queries with differential privacy is hard
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingA central problem in differentially private data analysis is how to design efficient algorithms capable of answering large numbers of counting queries on a sensitive database. Counting queries are of the form "What fraction of individual records in the ...
Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result such that it is provably hard for the adversary to infer the presence or ...
Answering $n^2+o(1)$ Counting Queries with Differential Privacy is Hard
A central problem in differentially private data analysis is how to design efficient algorithms capable of answering large numbers of counting queries on a sensitive database. Counting queries are of the form “What fraction of individual records in the ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/b23ca7f7-f36f-481a-9db2-85d8ebc45033/3605098.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 12Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in