Pufferfish
- 6 January 2014
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 39 (1), 1-36
- https://doi.org/10.1145/2514689
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.Keywords
Funding Information
- National Science Foundation (1054389 and 1253327)
This publication has 40 references indexed in Scilit:
- Privacy-preserving data publishingACM Computing Surveys, 2010
- Genomic privacy and limits of individual detection in a poolNature Genetics, 2009
- Privacy-Preserving Data PublishingFoundations and Trends® in Databases, 2009
- Resolving Individuals Contributing Trace Amounts of DNA to Highly Complex Mixtures Using High-Density SNP Genotyping MicroarraysPLoS Genetics, 2008
- An efficient sanitization algorithm for balancing information privacy and knowledge discovery in association patterns miningData & Knowledge Engineering, 2008
- A MaxMin approach for hiding frequent itemsetsData & Knowledge Engineering, 2008
- Association rule hidingIEEE Transactions on Knowledge and Data Engineering, 2004
- State-of-the-art in privacy preserving data miningACM SIGMOD Record, 2004
- Protecting respondents identities in microdata releaseIEEE Transactions on Knowledge and Data Engineering, 2001
- Security-control methods for statistical databases: a comparative studyACM Computing Surveys, 1989