The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Boosting the accuracy of differentially private histograms through consistency
Open accessAbstract
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a set of queries to evaluate, and then exploits consistency constraints that should hold over the noisy output. In a post-processing phase, we compute the consistent input most likely to have produced the noisy output. The final output is differentially-private and consistent, but in addition, it is often much more accurate. We show, both theoretically and experimentally, that these techniques can be used for estimating the degree sequence of a graph very precisely, and for computing a histogram that can support arbitrary range queries accurately.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · cited 2×
“Dwork has written comprehensive reviews of differential privacy [7, 8]; below we highlight results closest to this work.”
MethodStatistical Inference Under Order Restrictions
Kalbfleisch, J. D. (1975) · Technometrics · doi:10.1080/00401706.1975.10489288 · Cited by 1,546
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559850 · Cited by 1,124
A firm foundation for private data analysis
Dwork, C. (2011) · Communications of the ACM · doi:10.1145/1866739.1866758 · Cited by 841
Statistical inference under order restrictions
(1973) · Statistica Neerlandica · doi:10.1111/j.1467-9574.1973.tb00228.x · Cited by 820
Towards identity anonymization on graphs
Liu, K., & Terzi, E. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376629 · Cited by 773
Preserving Privacy in Social Networks Against Neighborhood Attacks
Zhou, B., & Pei, J. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497459 · Cited by 719
Silvey, S. D. (2017) · Routledge eBooks · doi:10.1201/9780203738641 · Cited by 552
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
Self-citationA learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., & Talwar, K. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265569 · Cited by 468
Accurate Estimation of the Degree Distribution of Private Networks
Hay, M., Li, C., Miklau, G., & Jensen, D. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.11 · Cited by 387
Self-citationOn the geometry of differential privacy
Hardt, M., & Talwar, K. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806786 · Cited by 314
Universally utility-maximizing privacy mechanisms
Ghosh, A., Roughgarden, T., & Sundararajan, M. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536464 · Cited by 246
The Isotonic Regression Problem and its Dual
Barlow, R. E., & Brunk, H. D. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481216 · Cited by 245 · cited 1×
“[3]), as well as linear time algorithms for computing it (cf.”
BackgroundInteractive privacy via the median mechanism
Roth, A., & Roughgarden, T. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806794 · Cited by 226
Differential privacy via wavelet transforms
Xiao, X., Wang, G., & Gehrke, J. (2010) · 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) · doi:10.1109/icde.2010.5447831 · Cited by 178
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. X. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14162-1_34 · Cited by 87
Boosting the Accuracy of Differentially-Private Queries Through Consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. M. (2009) · Cited by 24
Self-citation
Cited by
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
Self-citationDifferentially private aggregation of distributed time-series with transformation and encryption
Rastogi, V., & Nath, S. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807247 · Cited by 534
Self-citationDifferential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
“Earlier, Hay et al. [75] propose to add Laplace noise Lap ( 1 ) to the set of results of queries q , and send the noisy results ˜ q to the data analyst.”
BackgroundDifferentially Private Spatial Decompositions
Cormode, G., Procopiuc, C., Srivastava, D., Shen, E., & Yu, T. (2012) · 2012 IEEE 28th International Conference on Data Engineering · doi:10.1109/icde.2012.16 · Cited by 411
PrivBayes: Private Data Release via Bayesian Networks
Zhang, J., Cormode, G., Procopiuc, C. M., Srivastava, D., & Xiao, X. (2017) · ACM Transactions on Database Systems · doi:10.1145/3134428 · Cited by 399
Metadata
- Authors
- Hay, M., Rastogi, V., Miklau, G., & Suciu, D.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2010-09
- Volume
- 3
- Issue
- 1-2
- Pages
- 1021-1032
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2057576485
- Cited by
- 528
- References
- 21
- FWCI
- 37.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.