The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Pufferfish: A framework for mathematical privacy definitions
Abstract
In this article, we introduce a new and general privacy framework called Pufferfish. The Pufferfish framework can be used to create new privacy definitions that are customized to the needs of a given application. The goal of Pufferfish is to allow experts in an application domain, who frequently do not have expertise in privacy, to develop rigorous privacy definitions for their data sharing needs. In addition to this, the Pufferfish framework can also be used to study existing privacy definitions. We illustrate the benefits with several applications of this privacy framework: we use it to analyze differential privacy and formalize a connection to attackers who believe that the data records are independent; we use it to create a privacy definition called hedging privacy, which can be used to rule out attackers whose prior beliefs are inconsistent with the data; we use the framework to define and study the notion of composition in a broader context than before; we show how to apply the framework to protect unbounded continuous attributes and aggregate information; and we show how to use the framework to rigorously account for prior data releases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
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
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
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
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704 · cited 1×
“Because of this, the resulting privacy definitions tend to be less secure and are often subject to new kinds of attacks (see the surveys [Chen et al. 2009; Fung et al. 2010; Adam and Worthmann 1989] for more details). is also often not clear what data protecting individual records.”
BackgroundHomer, N., Szelinger, S., Redman, M., Duggan, D., Tembe, W., Muehling, J., Pearson, J. V., Stephan, D. A., Nelson, S. F., & Craig, D. W. (2008) · PLoS Genetics · doi:10.1371/journal.pgen.1000167 · Cited by 1,221
Privacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559850 · Cited by 1,124
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Smooth 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
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygin, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 816
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
Kifer, D., & Machanavajjhala, A. (2011) · Proceedings of the 2011 ACM SIGMOD International Conference on Management of data · doi:10.1145/1989323.1989345 · Cited by 619
Self-citationDifferential privacy under continual observation
Dwork, C., Naor, M., Pitassi, T., & Rothblum, G. N. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806787 · Cited by 583
Verykios, V. S., Elmagarmid, A. K., Bertino, E., Saygin, Y., & Dasseni, E. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.1269668 · Cited by 518
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
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
Self-citationComposition 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
Aggregate Query Answering on Anonymized Tables
Zhang, Q., Koudas, N., Srivastava, D., & Yu, T. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367857 · Cited by 357
SECURITY AND PRIVACY IMPLICATIONS OF DATA MINING
Clifton, C., & Marks, D. G. (1996) · Cited by 271
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
Computational Differential Privacy
Mironov, I., Pandey, O., Reingold, O., & Vadhan, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_8 · Cited by 231
The price of privacy and the limits of LP decoding
Dwork, C., McSherry, F., & Talwar, K. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250804 · Cited by 205
Genomic privacy and limits of individual detection in a pool
Sankararaman, S., Obozinski, G., Jordan, M. I., & Halperin, E. (2009) · Nature Genetics · doi:10.1038/ng.436 · Cited by 199
Personalized social recommendations: accurate or private
Machanavajjhala, A., Korolova, A., & Sarma, A. D. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1988776.1988780 · Cited by 174
Self-citationAttacks on privacy and deFinetti's theorem
Kifer, D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559861 · Cited by 162
Self-citationA rigorous and customizable framework for privacy
Kifer, D., & Machanavajjhala, A. (2012) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/2213556.2213571 · Cited by 154
Self-citationPrivacy-Preserving Data Publishing
Chen, B.-C., Kifer, D., LeFevre, K., & Machanavajjhala, A. (2009) · Foundations and Trends in Databases · doi:10.1561/1900000008 · Cited by 147
Self-citationDefining Privacy for Data Mining
Clifton, C., Kantarcıoğlu, M., & Vaidya, J. S. (2002) · Cited by 138
Rastogi, V., Hay, M., Miklau, G., & Suciu, D. M. (2009) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1559795.1559812 · Cited by 137
Dwork, C., & Naor, M. (2010) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v2i1.585 · Cited by 128
Pan-Private Streaming Algorithms
Dwork, C., Naor, M., Pitassi, T., Rothblum, G. N., & Yekhanin, S. (2010) · Cited by 127
Template-Based Privacy Preservation in Classification Problems
Wang, K., Fung, B. C. M., & Yu, P. S. (2006) · Proceedings · doi:10.1109/icdm.2005.142 · Cited by 115
Towards an axiomatization of statistical privacy and utility
Kifer, D., & Lin, B.-R. (2010) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1807085.1807106 · Cited by 114
Self-citationTowards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
Gehrke, J. E., Lui, E., & Pass, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_26 · Cited by 108
When Random Sampling Preserves Privacy
Chaudhuri, K., & Mishra, N. (2006) · Lecture notes in computer science · doi:10.1007/11818175_12 · Cited by 101
Using sample size to limit exposure to data mining
Clifton, C. (2000) · Journal of Computer Security · doi:10.3233/jcs-2000-8403 · Cited by 98
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. X. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14162-1_34 · Cited by 87
Hall, R., Wasserman, L., & Rinaldo, A. (2013) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v4i2.621 · Cited by 83
Bhaskar, R., Bhowmick, A., Goyal, V., Laxman, S., & Thakurta, A. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25385-0_12 · Cited by 79
Gehrke, J. E., Hay, M., Lui, E., & Pass, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_28 · Cited by 79
On privacy preservation against adversarial data mining
Aggarwal, C. C., Pei, J., & Zhang, B. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150460 · Cited by 65
Differential privacy with compression
Zhou, S., Ligett, K., & Wasserman, L. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205863 · Cited by 60
An Axiomatic View of Statistical Privacy and Utility
Kifer, D., & Lin, B.-R. (2012) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v4i1.610 · Cited by 59
Self-citationDuan, Y. (2009) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1645953.1646160 · Cited by 38
A reconstruction-based algorithm for classification rules hiding
Natwichai, J., Li, X., & Orłowska, M. E. (2006) · Cited by 32
Wang, E. T., & Lee, G. (2008) · Data & Knowledge Engineering · doi:10.1016/j.datak.2007.12.005 · Cited by 27
Using sample size to limit exposure to data mining
CliftonChris (2000) · Journal of Computer Security · doi:10.5555/371090.371092 · Cited by 9
Research works printed but not linked: 7
- 10.1198/000313004X1189 · doi:10.1198/000313004x1189
- 10.1145/1774088.1774216 · doi:10.1145/1774088.1774216
- Stephen E. Fienberg . 1997. Confidentiality and disclosure limitation methodology: Challenges for national statistics and statistical research. Tech. rep. 668 , Carnegie Mellon University . Stephen E. Fienberg. 1997. Confidentiality and disclosure limitation methodology: Challenges for national statistics and statistical research. Tech. rep. 668, Carnegie Mellon University.
- Shiva Prasad Kasiviswanathan and Adam Smith. 2008. A note on differential privacy: Defining resistance to arbitrary side information. http://arxiv.org/abs/0803.3946. Shiva Prasad Kasiviswanathan and Adam Smith. 2008. A note on differential privacy: Defining resistance to arbitrary side information. http://arxiv.org/abs/0803.3946. · arXiv
- 10.1016/j.datak.2007.06.012 · doi:10.1016/j.datak.2007.06.012
- Stanley R. M. Oliveira and Osmar R. Zaiane. 2003. Algorithms for balancing privacy and knowledge discovery in association rule mining . In Proceedings of the 7th International Database Engineering and Applications Symposium. 54--63 . Stanley R. M. Oliveira and Osmar R. Zaiane. 2003. Algorithms for balancing privacy and knowledge discovery in association rule mining. In Proceedings of the 7th International Database Engineering and Applications Symposium. 54--63.
- 10.5555/1700967.1701079 · doi:10.5555/1700967.1701079
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
Mironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255
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
Differentially Private Data Publishing and Analysis: A Survey
Zhu, T., Li, G., Zhou, W., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2697856 · Cited by 330
An Intersectional Definition of Fairness
Foulds, J. R., Islam, R., Keya, K. N., & Pan, S. (2020) · 2020 IEEE 36th International Conference on Data Engineering (ICDE) · doi:10.1109/icde48307.2020.00203 · Cited by 233
Metadata
- Authors
- Kifer, D., & Machanavajjhala, A.
- Venue
- ACM Transactions on Database Systems
- Published
- 2014-01
- Volume
- 39
- Issue
- 1
- Pages
- 1-36
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2033092546
- Cited by
- 267
- References
- 51
- FWCI
- 14.19
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- National Science Foundation (1054389 and 1253327)
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.