The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Distance makes the types grow stronger: a calculus for differential privacy
Abstract
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guarantee that the effect of the presence of any individual in a database will be negligible, even when an adversary has auxiliary knowledge. Much of the prior work in this area consists of proving algorithms to be differentially private one at a time; we propose to streamline this process with a functional language whose type system automatically guarantees differential privacy, allowing the programmer to write complex privacy-safe query programs in a flexible and compositional way.
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
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
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 1×
“Dwork [13] gives a useful survey of recent results.”
ResultRobust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Why and Where: A Characterization of Data Provenance
Buneman, P., Khanna, S., & Wang-Chiew, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_20 · Cited by 1,334
Green, T. J., Karvounarakis, G., & Tannen, V. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265535 · Cited by 812
Cited by
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
Broadening the Scope of Differential Privacy Using Metrics
Chatzikokolakis, K., Andrés, M. E., Bordenabe, N. E., & Palamidessi, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39077-7_5 · Cited by 340
Differentially private iterative synchronous consensus
Huang, Z., Mitra, S., & Dullerud, G. (2012) · Proceedings of the 2012 ACM workshop on Privacy in the electronic society · doi:10.1145/2381966.2381978 · Cited by 280
A Core Quantitative Coeffect Calculus
Brunel, A., Gaboardi, M., Mazza, D., & Zdancewic, S. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54833-8_19 · Cited by 90
Really Natural Linear Indexed Type Checking
de Amorim, A. A., Gaboardi, M., Gallego Arias, E. J., & Hsu, J. (2014) · Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages · doi:10.1145/2746325.2746335 · Cited by 25
Metadata
- Authors
- Reed, J., & Pierce, B. C.
- Venue
- Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
- Publisher
- ACM
- Published
- 2010-09-27
- Pages
- 157-168
- OpenAlex
- W2097061283
- Cited by
- 214
- References
- 6
- FWCI
- 12.73
- 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: Distance makes the types grow stronger: a calculus for differential privacy. https://app.cochat.ai/papers/10.1145/1863543.1863568
- The paper
- Reed, J., & Pierce, B. C. (2010). Distance makes the types grow stronger: a calculus for differential privacy. Proceedings of the 15th ACM SIGPLAN international conference on Functional programming. https://doi.org/10.1145/1863543.1863568
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.