On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy

By Cynthia Dwork, Moni Naor. 2010

154 citations recorded by the source corpus.

In 1977 Tore Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that a natural formalization of Dalenius’ goal cannot be achieved if the database is useful. The key obstacle is the side information that may be available to an adversary. Our results hold under very general conditions regarding the database, the notion of privacy violation, and the notion of utility. Contrary to intuition, a variant of the result threatens the privacy even of someone not in the database. This state of affairs motivated the notion of differential privacy [15, 16], a strong ad omnia privacy which, intuitively, captures the increased risk to one’s privacy incurred by participating in a database.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Privacy & Security

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Vitaly Shmatikov
  2. Reza Shokri
  3. Daniel Kifer
  4. Adam D. Smith
  5. Philip S. Yu
  6. Ashwin Machanavajjhala
  7. Abhradeep Thakurta
  8. Jonathan Ullman

In Computational Theory and Mathematics

  1. Adam D. Smith
  2. Cynthia Dwork
  3. Ashwin Machanavajjhala
  4. Aaron Roth
  5. Daniel Kifer
  6. Shiva Prasad Kasiviswanathan
  7. Kobbi Nissim
  8. Philip S. Yu

In Privacy & Security

  1. Daniel Kifer
  2. Adam D. Smith
  3. Ashwin Machanavajjhala
  4. Abhradeep Thakurta
  5. Vitaly Shmatikov
  6. Kamalika Chaudhuri
  7. Philip S. Yu
  8. Cynthia Dwork

Citations in the corpus