The Staircase Mechanism in Differential Privacy
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Adding Laplacian noise is a standard approach in differential privacy to sanitize numerical data before releasing it. In this paper, we propose an alternative noise adding mechanism: the staircase mechanism, which is a geometric mixture of uniform random variables. The staircase mechanism can replace the Laplace mechanism in each instance in the literature and for the same level of differential privacy, the performance in each instance improves; the improvement is particularly stark in medium-low privacy regimes. We show that the staircase mechanism is the optimal noise adding mechanism in a universal context, subject to a conjectured technical lemma (which we also prove to be true for one and two dimensional data).
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
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 13×
“, one is a proper subset of the other and the larger dataset contains just one additional element [1].”
BackgroundMethodInfluentialOur Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898
Cited by
Collecting and Analyzing Multidimensional Data with Local Differential Privacy
Wang, N., Xiao, X., Yang, Y., Zhao, J., Hui, S. C., Shin, H., Shin, J., & Yu, G. (2019) · 2019 IEEE 35th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2019.00063 · Cited by 381
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307
“A recent work [83] used the staircasemechanism to replace the Laplacemechanism in order to reduce the amount of noise needed for differential privacy.”
MethodA Review of Privacy-Preserving Federated Learning for the Internet-of-Things
Briggs, C., Fan, Z., & Andras, P. (2021) · Studies in Computational Intelligence · doi:10.1007/978-3-030-70604-3_2 · Cited by 101
Minimax Rates of Estimating Approximate Differential Privacy
Liu, X., & Oh, S. (2019) · arXiv · doi:10.48550/arxiv.1905.10335 · Cited by 4
Self-citation
Metadata
- Authors
- Geng, Q., Kairouz, P., Oh, S., & Viswanath, P.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2015-10
- Volume
- 9
- Issue
- 7
- Pages
- 1176-1184
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W1966072539
- Cited by
- 140
- References
- 4
- FWCI
- 7.82
- Type
- journal article
- 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: The Staircase Mechanism in Differential Privacy. https://app.cochat.ai/papers/10.1109/jstsp.2015.2425831
- The paper
- Geng, Q., Kairouz, P., Oh, S., & Viswanath, P. (2015). The Staircase Mechanism in Differential Privacy. IEEE Journal of Selected Topics in Signal Processing. https://doi.org/10.1109/jstsp.2015.2425831
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.