The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
On significance of the least significant bits for differential privacy
Abstract
We describe a new type of vulnerability present in many implementations of differentially private mechanisms. In particular, all four publicly available general purpose systems for differentially private computations are susceptible to our attack.
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
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
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×
“Examples of such mechanisms include differ-entially private computations in a distributed setting [11], privacy-preserving billing and aggregation [5, 24].”
BackgroundSelf-citationGenerating quasi-random sequences from semi-random sources
Santha, M., & Vazirani, U. V. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90044-9 · Cited by 256
Research works printed but not linked: 34
- 10.1007/978-3-642-25385-0_12 · DOI
- 10.1109/FOCS.2012.67 · DOI
- K. Chaudhuri and C. Monteleoni . Privacy-preserving logistic regression . In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Advances in Neural Information Processing Systems 21 (NIPS) , pages 289 -- 296 . Curran Associates, Inc. , 2008 . K. Chaudhuri and C. Monteleoni. Privacy-preserving logistic regression. In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Advances in Neural Information Processing Systems 21 (NIPS), pages 289--296. Curran Associates, Inc., 2008.
- 10.5555/2042445.2042459 · doi:10.5555/2042445.2042459
- 10.1051/ita:2007003 · DOI
- 10.1007/978-3-642-32009-5_29 · DOI
- 10.1109/FOCS.2004.44 · DOI
- 10.1007/11787006_1 · DOI · Paper page
- 10.1145/1866739.1866758 · DOI · Paper page
- C. Dwork and K. Nissim . Privacy-preserving datamining on vertically partitioned databases . In M. K. Franklin, editor, Advances in Cryptology--CRYPTO 2004 , volume 3152 of Lecture Notes in Computer Science , pages 528 -- 544 . Springer , 2004. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In M. K. Franklin, editor, Advances in Cryptology--CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 528--544. Springer, 2004. · DOI · Paper page
- T. Evans , L. Zayatz , and J. Slanta . Using noise for disclosure limitation of establishment tabular data . J. of Official Statistics , 14 ( 4 ): 537 -- 551 , 1998 . T. Evans, L. Zayatz, and J. Slanta. Using noise for disclosure limitation of establishment tabular data. J. of Official Statistics, 14(4):537--551, 1998.
- 10.1145/1536414.1536464 · DOI · Paper page
- V. D. Gligor . A guide to understanding covert channel analysis of trusted systems. Technical Report NCSC-TG-030 , National Computer Security Center , Nov. 1993 . V. D. Gligor. A guide to understanding covert channel analysis of trusted systems. Technical Report NCSC-TG-030, National Computer Security Center, Nov. 1993.
- 10.1145/103162.103163 · DOI · Paper page
- A. Haeberlen , B. C. Pierce , and A. Narayan . Differential privacy under fire . In USENIX Security Symposium. USENIX Association , 2011 . A. Haeberlen, B. C. Pierce, and A. Narayan. Differential privacy under fire. In USENIX Security Symposium. USENIX Association, 2011.
- M. Hardt , K. Ligett , and F. McSherry . A simple and practical algorithm for differentially private data release. CoRR, abs/1012.4763 , 2010 . M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. CoRR, abs/1012.4763, 2010. · arXiv
- IEEE standard for floating-point arithmetic. Technical report, Microprocessor Standards Committee of the IEEE Computer Society, 3 Park Avenue, New York, NY 10016--5997 , USA , Aug. 2008 . IEEE standard for floating-point arithmetic. Technical report, Microprocessor Standards Committee of the IEEE Computer Society, 3 Park Avenue, New York, NY 10016--5997, USA, Aug. 2008.
- 10.1145/363707.363723 · DOI
- D. E. Knuth . Seminumerical Algorithms , volume 2 of The Art of Computer Programming . Addison-Wesley , third edition, 1997 . D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, third edition, 1997.
- K. Kursawe G. Danezis and M. Kohlweiss . Privacy-friendly aggregation for the smart-grid . In S. Fischer-Hübner and N. Hopper editors PETS volume 6794 of Lecture Notes in Computer Science pages 175 -- 191 . Springer 2011 . K. Kursawe G. Danezis and M. Kohlweiss. Privacy-friendly aggregation for the smart-grid. In S. Fischer-Hübner and N. Hopper editors PETS volume 6794 of Lecture Notes in Computer Science pages 175--191. Springer 2011. · DOI · Paper page
- 10.1145/362375.362389 · DOI · Paper page
- 10.1145/1807085.1807104 · DOI · Paper page
- 10.1109/ICDE.2008.4497436 · DOI · Paper page
- J. L. McInnes and B. Pinkas . On the impossibility of private key cryptography with weakly random keys . In A. Menezes and S. A. Vanstone, editors, Advances in Cryptology--CRYPTO '90 , volume 537 of Lecture Notes in Computer Science , pages 421 -- 435 . Springer , 1991 . J. L. McInnes and B. Pinkas. On the impossibility of private key cryptography with weakly random keys. In A. Menezes and S. A. Vanstone, editors, Advances in Cryptology--CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 421--435. Springer, 1991. · DOI
- 10.1145/1559845.1559850 · DOI · Paper page
- 10.1145/1810891.1810916 · DOI · Paper page
- 10.1145/1851182.1851199 · DOI
- 10.1145/1557019.1557090 · DOI · Paper page
- 10.1145/2213836.2213876 · DOI · Paper page
- 10.5555/1823389 · doi:10.5555/1823389
- 10.1145/1250790.1250803 · DOI · Paper page
- W. H. Press , S. A. Teukolsky , W. T. Vetterling , and B. P. Flannery . Numerical Recipes: The Art of Scientific Computing . Cambridge University Press , New York, NY, USA , third edition, 2007 . W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, New York, NY, USA, third edition, 2007.
- 10.1145/1863543.1863568 · DOI · Paper page
- I. Roy , S. T. V. Setty , A. Kilzer , V. Shmatikov , and E. Witchel . Airavat: Security and privacy for MapReduce . In Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2010 , pages 297 -- 312 . USENIX Association , 2010 . I. Roy, S. T. V. Setty, A. Kilzer, V. Shmatikov, and E. Witchel. Airavat: Security and privacy for MapReduce. In Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2010, pages 297--312. USENIX Association, 2010.
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
“, [296, 192] for differential privacy).”
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
Geo-indistinguishability: differential privacy for location-based systems
Andrés, M. E., Bordenabe, N. E., Chatzikokolakis, K., & Palamidessi, C. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516735 · Cited by 1,059
Algorithms that remember: model inversion attacks and data protection law
Veale, M., Binns, R., & Edwards, L. (2018) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2018.0083 · Cited by 278
Metadata
- Authors
- Mironov, I.
- Venue
- Proceedings of the 2012 ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2012-10-16
- Pages
- 650-661
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2042946599
- Cited by
- 176
- References
- 4
- FWCI
- 7.39
- 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: On significance of the least significant bits for differential privacy. https://app.cochat.ai/papers/10.1145/2382196.2382264
- The paper
- Mironov, I. (2012). On significance of the least significant bits for differential privacy. Proceedings of the 2012 ACM conference on Computer and communications security. https://doi.org/10.1145/2382196.2382264
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.