Secure Multiparty Computation for Privacy-Preserving Data Mining

By Yehuda Lindell, Benny Pinkas. 2009

791 citations recorded by the source corpus.

In this paper, we survey the basic paradigms and notions of secure mul- tiparty computation and discuss their relevance to the fleld of privacy-preserving data mining. In addition to reviewing deflnitions and constructions for secure mul- tiparty computation, we discuss the issue of e-ciency and demonstrate the di-cul- ties involved in constructing highly e-cient protocols. We also present common errors that are prevalent in the literature when secure multiparty computation techniques are applied to privacy-preserving data mining. Finally, we discuss the relationship between secure multiparty computation and privacy-preserving data mining, and show which problems it solves and which problems it does not.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

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. Salil P. Vadhan
  2. Kobbi Nissim
  3. David E. Evans
  4. Wenjing Lou
  5. Aurélien Bellet
  6. Ming Li
  7. Jonathan Ullman
  8. Li Xiong

In Computational Theory and Mathematics

  1. Salil P. Vadhan
  2. Kobbi Nissim
  3. David E. Evans
  4. Daniel Noble
  5. Alexandra Wood
  6. Aurélien Bellet
  7. Jonathan Ullman
  8. Scott Shenker

Citations in the corpus