The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Universally utility-maximizing privacy mechanisms
Abstract
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information maximizes utility while minimizing privacy, while publishing random noise accomplishes the opposite. Privacy can be rigorously quantified using the framework of differential privacy, which requires that a mechanism's output distribution is nearly the same whether or not a given database row is included or excluded. The goal of this paper is strong and general utility guarantees, subject to differential privacy. We pursue mechanisms that guarantee near-optimal utility to every potential user, independent of its side information (modeled as a prior distribution over query results) and preferences (modeled via a loss function). Our main result is: for each fixed count query and differential privacy level, there is a geometric mechanism M* -- a discrete variant of the simple and well-studied Laplace mechanism -- that is simultaneously expected loss-minimizing for every possible user, subject to the differential privacy constraint. This is an extremely strong utility guarantee: every potential user u, no matter what its side information and preferences, derives as much utility from M* as from interacting with a differentially private mechanism Mu that is optimally tailored to u. More precisely, for every user u there is an optimal mechanism Mu for it that factors into a user-independent part (the geometric mechanism M*) followed by user-specific post-processing that can be delegated to the user itself. The first part of our proof of this result characterizes the optimal differentially private mechanism for a fixed but arbitrary user in terms of a certain basic feasible solution to a linear program with constraints that encode differential privacy. The second part shows that all of the relevant vertices of this polytope (ranging over all possible users) are derivable from the geometric mechanism via suitable remappings of its range.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Research works printed but not linked: 15
- 10.1145/1242572.1242598 · DOI · Paper page
- 10.1145/1265530.1265569 · DOI · Paper page
- D. Bertsimas and J. N. Tsitsiklis . Introduction to Linear Optimization . Athena Scientific , 1997 . D. Bertsimas and J. N. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997.
- 10.1145/1065167.1065184 · DOI · Paper page
- 10.1145/1374376.1374464 · DOI · Paper page
- 10.1145/773153.773173 · DOI · Paper page
- 10.1007/11787006_1 · DOI · Paper page
- 10.5555/1791834.1791836 · doi:10.5555/1791834.1791836
- 10.1145/1250790.1250804 · DOI · Paper page
- 10.1007/978-3-540-28628-8_32 · DOI · Paper page
- 10.1109/FOCS.2008.27 · DOI · Paper page
- S. P. Kasiviswanathan and A. Smith. A note on differential privacy: Defining resistance to arbitrary side information. http://arxiv.org/abs/0803.3946v1 2008. S. P. Kasiviswanathan and A. Smith. A note on differential privacy: Defining resistance to arbitrary side information. http://arxiv.org/abs/0803.3946v1 2008. · arXiv
- A. Mas-Colell , M. D. Whinston , and J. R. Green . Microeconomic Theory . Oxford University Press , New York , 1995 . A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, New York, 1995.
- 10.1109/FOCS.2007.41 · DOI · Paper page
- 10.1145/1250790.1250803 · DOI · Paper page
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“with a low ε / high privacy level) [12, 330, 181, 356, 188].”
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
Broadening the Scope of Differential Privacy Using Metrics
Chatzikokolakis, K., Andrés, M. E., Bordenabe, N. E., & Palamidessi, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39077-7_5 · Cited by 340
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
Pufferfish: A framework for mathematical privacy definitions
Kifer, D., & Machanavajjhala, A. (2014) · ACM Transactions on Database Systems · doi:10.1145/2514689 · Cited by 267
Metadata
- Authors
- Ghosh, A., Roughgarden, T., & Sundararajan, M.
- Venue
- Proceedings of the forty-first annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2009-05-31
- Pages
- 351-360
- OpenAlex
- W2154086287
- Cited by
- 246
- References
- 3
- FWCI
- 16.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universally utility-maximizing privacy mechanisms. https://app.cochat.ai/papers/10.1145/1536414.1536464
- The paper
- Ghosh, A., Roughgarden, T., & Sundararajan, M. (2009). Universally utility-maximizing privacy mechanisms. Proceedings of the forty-first annual ACM symposium on Theory of computing. https://doi.org/10.1145/1536414.1536464
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.