Introduction to algorithms
Optimal Histograms with Quality Guarantees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Approximation and streaming algorithms for histogram construction problems
ACM Transactions on Database Systems (TODS)
The price of privacy and the limits of LP decoding
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
A learning theory approach to non-interactive database privacy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Releasing search queries and clicks privately
Proceedings of the 18th international conference on World wide web
Proceedings of the 16th ACM conference on Computer and communications security
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
Differentially-private network trace analysis
Proceedings of the ACM SIGCOMM 2010 conference
Differentially private data release through multidimensional partitioning
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
Boosting and Differential Privacy
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Boosting the accuracy of differentially private histograms through consistency
Proceedings of the VLDB Endowment
Differentially private data cubes: optimizing noise sources and consistency
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
iReduct: differential privacy with reduced relative errors
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Publishing Search Logs—A Comparative Study of Privacy Guarantees
IEEE Transactions on Knowledge and Data Engineering
An adaptive mechanism for accurate query answering under differential privacy
Proceedings of the VLDB Endowment
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
GUPT: privacy preserving data analysis made easy
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Differentially Private Spatial Decompositions
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Low-rank mechanism: optimizing batch queries under differential privacy
Proceedings of the VLDB Endowment
Functional mechanism: regression analysis under differential privacy
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Differential privacy (DP) is a promising scheme for releasing the results of statistical queries on sensitive data, with strong privacy guarantees against adversaries with arbitrary background knowledge. Existing studies on differential privacy mostly focus on simple aggregations such as counts. This paper investigates the publication of DP-compliant histograms, which is an important analytical tool for showing the distribution of a random variable, e.g., hospital bill size for certain patients. Compared to simple aggregations whose results are purely numerical, a histogram query is inherently more complex, since it must also determine its structure, i.e., the ranges of the bins. As we demonstrate in the paper, a DP-compliant histogram with finer bins may actually lead to significantly lower accuracy than a coarser one, since the former requires stronger perturbations in order to satisfy DP. Moreover, the histogram structure itself may reveal sensitive information, which further complicates the problem. Motivated by this, we propose two novel mechanisms, namely NoiseFirst and StructureFirst, for computing DP-compliant histograms. Their main difference lies in the relative order of the noise injection and the histogram structure computation steps. NoiseFirst has the additional benefit that it can improve the accuracy of an already published DP-compliant histogram computed using a naive method. For each of proposed mechanisms, we design algorithms for computing the optimal histogram structure with two different objectives: minimizing the mean square error and the mean absolute error, respectively. Going one step further, we extend both mechanisms to answer arbitrary range queries. Extensive experiments, using several real datasets, confirm that our two proposals output highly accurate query answers and consistently outperform existing competitors.