Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Wavelet synopses for general error metrics
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Smooth sensitivity and sampling in private data analysis
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mechanism Design via Differential Privacy
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A learning theory approach to non-interactive database privacy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Releasing search queries and clicks privately
Proceedings of the 18th international conference on World wide web
Universally utility-maximizing privacy mechanisms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Privacy: Theory meets Practice on the Map
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Differentially private recommender systems: building privacy into the net
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal random perturbation at multiple privacy levels
Proceedings of the VLDB Endowment
On the geometry of differential privacy
Proceedings of the forty-second ACM symposium on Theory of computing
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing
Interactive privacy via the median mechanism
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Optimizing linear counting queries under differential privacy
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Differentially private aggregation of distributed time-series with transformation and encryption
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Data mining with differential privacy
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering frequent patterns in sensitive data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Boosting the accuracy of differentially private histograms through consistency
Proceedings of the VLDB Endowment
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Publishing Search Logs—A Comparative Study of Privacy Guarantees
IEEE Transactions on Knowledge and Data Engineering
Bounds on the sample complexity for private learning and private data release
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
An adaptive mechanism for accurate query answering under differential privacy
Proceedings of the VLDB Endowment
Differential privacy in data publication and analysis
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Integrating historical noisy answers for improving data utility under differential privacy
Proceedings of the 15th International Conference on Extending Database Technology
Differentially private transit data publication: a case study on the montreal transportation system
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Low-rank mechanism: optimizing batch queries under differential privacy
Proceedings of the VLDB Endowment
Publishing microdata with a robust privacy guarantee
Proceedings of the VLDB Endowment
Differentially private sequential data publication via variable-length n-grams
Proceedings of the 2012 ACM conference on Computer and communications security
Real-time aggregate monitoring with differential privacy
Proceedings of the 21st ACM international conference on Information and knowledge management
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
Differential privacy data release through adding noise on average value
NSS'12 Proceedings of the 6th international conference on Network and System Security
Efficient and accurate strategies for differentially-private sliding window queries
Proceedings of the 16th International Conference on Extending Database Technology
Differential privacy in intelligent transportation systems
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Practical differential privacy via grouping and smoothing
Proceedings of the VLDB Endowment
A two-phase algorithm for mining sequential patterns with differential privacy
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Differentially private multi-dimensional time series release for traffic monitoring
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
A general framework for privacy preserving data publishing
Knowledge-Based Systems
Differentially private histogram publication
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed and Parallel Databases
Hi-index | 0.00 |
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacy-preserving way. These techniques achieve privacy by adding noise to the query answers. Their objective is typically to minimize absolute errors while satisfying differential privacy. Thus, query answers are injected with noise whose scale is independent of whether the answers are large or small. The noisy results for queries whose true answers are small therefore tend to be dominated by noise, which leads to inferior data utility. This paper introduces iReduct, a differentially private algorithm for computing answers with reduced relative error. The basic idea of iReduct is to inject different amounts of noise to different query results, so that smaller (larger) values are more likely to be injected with less (more) noise. The algorithm is based on a novel resampling technique that employs correlated noise to improve data utility. Performance is evaluated on an instantiation of iReduct that generates marginals, i.e., projections of multi-dimensional histograms onto subsets of their attributes. Experiments on real data demonstrate the effectiveness of our solution.