Broadening the Scope of Differential Privacy Using Metrics
The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
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
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090255 · Cited by 3,501
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×
“An approximate version of d X -privacy can be defined, similarly to ( α, δ ) differential privacy [13].”
BackgroundDe-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
Hansmann, U., Stöber, T., Merk, L., & Nicklous, M. S. (2003) · Cited by 1,168
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
Self-citationSmooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
Shokri, R., Theodorakopoulos, G., Le Boudec, J.-Y., & Hubaux, J.-P. (2011) · 2011 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2011.18 · Cited by 699
A Formal Model of Obfuscation and Negotiation for Location Privacy
Duckham, M., & Kulik, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/11428572_10 · Cited by 628
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
Privacy: Theory meets Practice on the Map
Machanavajjhala, A., Kifer, D., Abowd, J., Gehrke, J., & Vilhuber, L. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497436 · Cited by 435
Composition attacks and auxiliary information in data privacy
Ganta, S. R., Kasiviswanathan, S. P., & Smith, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401926 · Cited by 395
Protecting Location Privacy Through Path Confusion
Hoh, B., & Gruteser, M. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.33 · Cited by 386
Protecting location privacy: optimal strategy against localization attacks
Shokri, R., Theodorakopoulos, G., Troncoso, C., Hubaux, J.-P., & Le Boudec, J.-Y. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382261 · Cited by 385
More Efficient Constant-Round Multi-party Computation from BMR and SHE
Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53641-4_21 · Cited by 360
A Novel Method to Construct Taxonomy Electrical Appliances Based on Load Signaturesof
Lam, H., Fung, G., & Lee, W. (2007) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2007.381742 · Cited by 324
Location Privacy Protection Through Obfuscation-Based Techniques
Ardagna, C. A., Cremonini, M., Damiani, E., De Capitani di Vimercati, S., & Samarati, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73538-0_4 · Cited by 308
Protection of Location Privacy using Dummies for Location-based Services
Kido, H., Yanagisawa, Y., & Satoh, T. (2005) · 21st International Conference on Data Engineering Workshops (ICDEW'05) · doi:10.1109/icde.2005.269 · Cited by 300
Universally utility-maximizing privacy mechanisms
Ghosh, A., Roughgarden, T., & Sundararajan, M. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536464 · Cited by 246
Distance makes the types grow stronger: a calculus for differential privacy
Reed, J., & Pierce, B. C. (2010) · Proceedings of the 15th ACM SIGPLAN international conference on Functional programming · doi:10.1145/1863543.1863568 · Cited by 214
Mechanism Design via Differential Privacy
McSherry, F., & Talwar, K. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.4389483 · Cited by 202
Privately querying location-based services with SybilQuery
Shankar, P., Ganapathy, V., & Iftode, L. (2009) · ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp) · doi:10.1145/1620545.1620550 · Cited by 134
Probabilistic relational reasoning for differential privacy
Barthe, G., Köpf, B., Olmedo, F., & Zanella-Béguelin, S. (2012) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2103656.2103670 · Cited by 131
Differential privacy for location pattern mining
Ho, S.-S., & Ruan, S. (2011) · International Workshop on Security and Privacy in GIS and LBS · doi:10.1145/2071880.2071884 · Cited by 109
Probabilistic relational reasoning for differential privacy
Barthe, G., Köpf, B., Olmedo, F., & Zanella-Béguelin, S. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103670 · Cited by 102
Information-Theoretic Bounds for Differentially Private Mechanisms
Barthe, G., & Köpf, B. (2011) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2011.20 · Cited by 92
Impossibility of Differentially Private Universally Optimal Mechanisms
Brenner, H., & Kobbi Nissim, B. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.13 · Cited by 61
Distance makes the types grow stronger: a calculus for differential privacy
Reed, J., & Pierce, B. C. (2010) · ACM SIGPLAN Notices · doi:10.1145/1932681.1863568 · Cited by 60
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
Self-citationCertified Robustness to Adversarial Examples with Differential Privacy
Lecuyer, M., Atlidakis, V., Geambasu, R., Hsu, D., & Jana, S. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00044 · Cited by 750
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
“easily preserve real-time continuously varying data from distributed linear devices by using the metric method presented in [311].”
MethodProtecting Locations with Differential Privacy under Temporal Correlations
Xiao, Y., & Xiong, L. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813640 · Cited by 376
A Survey on Differential Privacy for Unstructured Data Content
Zhao, Y., & Chen, J. (2022) · ACM Computing Surveys · doi:10.1145/3490237 · Cited by 313
Metadata
- Authors
- Chatzikokolakis, K., Andrés, M. E., Bordenabe, N. E., & Palamidessi, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 82-102
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1658920975
- Cited by
- 340
- References
- 31
- FWCI
- 10.19
- 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
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.