Cryptographic techniques for privacy-preserving data mining

  • Pinkas B
  • 88


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that non-trusting parties can jointly compute functions of their different inputs while ensuring that no party learns anything but the defined output of the function. These results were shown using generic constructions that can be applied to any function that has an efficient representation as a circuit. We describe these results, discuss their efficiency, and demonstrate their relevance to privacy preserving computation of data mining algorithms. We also show examples of secure computation of data mining algorithms that use these generic constructions.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Benny Pinkas

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free