In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient 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.
In REF , the basic paradigms and the notions of secure multiparty computation and its relation to privacy preserving data mining has been surveyed.
Secure Multiparty Computation for Privacy-Preserving Data Mining
IACR Cryptology ePrint Archive
IACR Cryptology ePrint Archive
Computer Science