The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Optimizing linear counting queries under differential privacy
Abstract
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answering a collection of related queries are not known.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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 3×
“[5], for releasing noisy answers to the workload of queries in matrix W.”
BackgroundMethod(1993) · Choice Reviews Online · doi:10.5860/choice.31-0986 · Cited by 1,540
Smooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
Silvey, S. D. (2017) · Routledge eBooks · doi:10.1201/9780203738641 · Cited by 552
Boosting the accuracy of differentially private histograms through consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920970 · Cited by 528
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
On 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
Dave, U. (1994) · Journal of the Operational Research Society · doi:10.1057/jors.1994.153 · Cited by 302
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
Interactive 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
The Differential Privacy Frontier (Extended Abstract)
Dwork, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_29 · Cited by 136
The Median Mechanism: Interactive and Efficient Privacy with Multiple QueriesPreprint
Roth, A., & Roughgarden, T. (2009) · arXiv (Cornell University) · Cited by 15
Cited by
Differential 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
“Li et al. [77] represent the main query as a set of linear base queries on the dataset’s attributes.”
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
Differential Privacy via Wavelet Transforms
Xiao, X., Wang, G., & Gehrke, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.247 · Cited by 369
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. (2011) · ACM Transactions on Information and System Security · doi:10.1145/2043621.2043626 · Cited by 352
Metadata
- Authors
- Li, C., Hay, M., Rastogi, V., Miklau, G., & McGregor, A.
- Venue
- Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2010-06-06
- Pages
- 123-134
- OpenAlex
- W2099259603
- Cited by
- 319
- References
- 16
- FWCI
- 24.69
- Type
- conference paper
- Language
- en
- Open access
- closed
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.