CoChat

The Composition Theorem for Differential Privacy

Open access
Kairouz, Peter, Oh, Sewoong, Viswanath, Pramod · 2017 · IEEE Transactions on Information Theory

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

Abstract

Sequential querying of differentially private mechanisms degrades the overall privacy level. In this paper, we answer the fundamental question of characterizing the level of overall privacy degradation as a function of the number of queries and the privacy levels maintained by each privatization mechanism. Our solution is complete: we prove an upper bound on the overall privacy level and construct a sequence of privatization mechanisms that achieves this bound. The key innovation is the introduction of an operational interpretation of differential privacy (involving hypothesis testing) and the use of a data processing inequality along with its converse. Our result improves over the state of the art, and has immediate connections to several problems studied in the literature.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2017.2685505

Cites

42 of 42 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 42 references

Research works printed but not linked: 2

  1. cover, 2012, Elements of Information Theory
  2. kairouz, 2015, The composition theorem for differential privacy, Proc Int Conf Mach Learn

Cited by

See all 408

Metadata

Authors
Kairouz, P., Oh, S., & Viswanath, P.
Affiliations
  • Stanford University (US)
  • University of Illinois Urbana-Champaign (US)
Venue
IEEE Transactions on Information Theory
Published
2017-06
Volume
63
Issue
6
Pages
4037-4049
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W1880309113
Cited by
408
References
34
Citations by year
2026: 26 · 2025: 33 · 2024: 55 · 2023: 44 · 2022: 49 · 2021: 48 · 2020: 47 · 2019: 35 · 2018: 27 · 2017: 18
FWCI
20.72
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Information Theory (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
  • International Conference on Machine Learning
Funders
  • NSF CISE (CCF-1422278, CCF-1553452)
  • NSF SaTC (CNS-1527754)
  • NSF CMMI (MES-1450848)
  • NSF ENG (ECCS-1232257)
  • Google Faculty Research Award
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
Keywords
differential privacy, composition theorem, upper bounds, hypothesis testing, data processing inequality, Converse

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: The Composition Theorem for Differential Privacy. https://app.cochat.ai/papers/10.1109/tit.2017.2685505
The paper
Kairouz, P., Oh, S., & Viswanath, P. (2017). The Composition Theorem for Differential Privacy. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2017.2685505

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.