The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
This paper proves that an "old dog", namely - the classical Johnson-Lindenstrauss transform, "performs new tricks" - it gives a novel way of preserving differential privacy. We show that if we take two databases, D and D', such that (i) D'-D is a rank-1 matrix of bounded norm and (ii) all singular values of D and D' are sufficiently large, then multiplying either D or D' with a vector of iid normal Gaussians yields two statistically close distributions in the sense of differential privacy. Furthermore, a small, deterministic and public alteration of the input is enough to assert that all singular values of D are large. We apply the Johnson-Lindenstrauss transform to the task of approximating cut-queries: the number of edges crossing a (S, S)-cut in a graph. We show that the JL transform allows us to publish a sanitized graph that preserves edge differential privacy (where two graphs are neighbors if they differ on a single edge) while adding only O(|S|ϵ) random noise to any given query (w.h.p). Comparing the additive noise of our algorithm to existing algorithms for answering cut-queries in a differentially private manner, we outperform all others on small cuts (|S| = o(n)). We also apply our technique to the task of estimating the variance of a given matrix in any given direction. The JL transform allows us to publish a sanitized covariance matrix that preserves differential privacy w.r.t bounded changes (each row in the matrix can change by at most a norm-1 vector) while adding random noise of magnitude independent of the size of the matrix (w.h.p). In contrast, existing algorithms introduce an error which depends on the matrix dimensions.
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
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
Our 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 · cited 1×
“Algorithm 1: Outputting the Laplacian of a Graph while Preserving Differential Privacy , and w = √ 2 , whose entries are iid samples of N (0 , 1).”
Boosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784 · cited 3×
“[HR10] and its various extensions [HLM10, GHRU11, GRU12]; the Median Mechanism [RR10] and a boosting mechanism of Dwork et al [DRV10].”
Background
Cited by
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Local, Private, Efficient Protocols for Succinct Histograms
Bassily, R., & Smith, A. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746632 · Cited by 315
A Survey on Differential Privacy for Unstructured Data Content
Zhao, Y., & Chen, J. (2022) · ACM Computing Surveys · doi:10.1145/3490237 · Cited by 313
COLLAGENE enables privacy-aware federated and collaborative genomic data analysis
Li, W., Kim, M., Zhang, K., Chen, H., Jiang, X., & Harmanci, A. (2023) · Genome Biology · doi:10.1186/s13059-023-03039-z · Cited by 16
“These approaches formulated the appropriate structure and levels of matrix noise for privacy-aware matrix-valued data publishing [68, 69].”
BackgroundInterpretable and Differentially Private Predictions
Harder, F., Bauer, M., & Park, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5827 · Cited by 6
Metadata
- Authors
- Blocki, J., Blum, A., Datta, A., & Sheffet, O.
- Venue
- 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2012-10
- Pages
- 410-419
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2028584480
- Cited by
- 136
- References
- 4
- FWCI
- 6.40
- 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: The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. https://app.cochat.ai/papers/10.1109/focs.2012.67
- The paper
- Blocki, J., Blum, A., Datta, A., & Sheffet, O. (2012). The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/focs.2012.67
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.