Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 267

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

Kifer, Daniel, Machanavajjhala, Ashwin·2014·ACM Transactions on Database Systems

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2514689

Cites

51 of 51 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 51 references

Research works printed but not linked: 7

  1. 10.1198/000313004X1189 · doi:10.1198/000313004x1189
  2. 10.1145/1774088.1774216 · doi:10.1145/1774088.1774216
  3. 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.
  4. 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
  5. 10.1016/j.datak.2007.06.012 · doi:10.1016/j.datak.2007.06.012
  6. 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.
  7. 10.5555/1700967.1701079 · doi:10.5555/1700967.1701079

Cited by

See all 267

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)
  • Google

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: Pufferfish: A framework for mathematical privacy definitions. https://app.cochat.ai/papers/10.1145/2514689
The paper
Kifer, D., & Machanavajjhala, A. (2014). Pufferfish: A framework for mathematical privacy definitions. ACM Transactions on Database Systems. https://doi.org/10.1145/2514689

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.