CoChat

The Algorithmic Foundations of Differential Privacy

Dwork, Cynthia, Roth, Aaron · 2013 · now publishers, Inc. eBooks

The DOI matches its Crossref record; 74 of the 75 references it cites were found in a registry or an index.

Abstract

The problem of privacy-preserving data analysis has a long history spanning multiple disciplines. As electronic data about individuals becomes increasingly detailed, and as technology enables ever more powerful collection and curation of these data, the need increases for a robust, meaningful, and mathematically rigorous definition of privacy, together with a computationally rich class of algorithms that satisfy this definition. Differential Privacy is such a definition. The Algorithmic Foundations of Differential Privacy starts out by motivating and discussing the meaning of differential privacy, and proceeds to explore the fundamental techniques for achieving differential privacy, and the application of these techniques in creative combinations, using the query-release problem as an ongoing example. A key point is that, by rethinking the computational goal, one can often obtain far better results than would be achieved by methodically replacing each step of a non-private computation with a differentially private implementation. Despite some powerful computational results, there are still fundamental limitations. Virtually all the algorithms discussed herein maintain differential privacy against adversaries of arbitrary computational power — certain algorithms are computationally intensive, others are efficient. Computational complexity for the adversary and the algorithm are both discussed. The monograph then turns from fundamentals to applications other than query-release,…

Overview

Integrity signals

Registry

Crossref · 10.1561/9781601988195

Cites

74 of 74 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 74 references

Cited by

Items 901–1,000 of 1,041

Metadata

Authors
Dwork, C., & Roth, A.
Affiliations
  • Microsoft (United States) (US)
  • University of Pennsylvania (US)
Venue
now publishers, Inc. eBooks
Published
2013
OpenAlex
W2027595342
Cited by
3,856
References
75
Citations by year
2026: 180 · 2025: 269 · 2024: 391 · 2023: 290 · 2022: 327 · 2021: 729 · 2020: 596 · 2019: 435 · 2018: 250 · 2017: 194 · 2016: 122 · 2015: 56 · 2014: 12 · 2013: 3
FWCI
23.36
Type
book
Language
en
Open access
closed
Locations
  • now publishers, Inc. eBooks (publishedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
differential privacy, privacy-preserving data analysis, computational complexity, mechanism design, distributed databases, data streams

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.