Cryptographic techniques for privacy-preserving data mining
Top Cited Papers
- 1 December 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 4 (2) , 12-19
- https://doi.org/10.1145/772862.772865
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- Privacy preserving auctions and mechanism designPublished by Association for Computing Machinery (ACM) ,1999
- Oblivious transfer and polynomial evaluationPublished by Association for Computing Machinery (ACM) ,1999
- Introduction to Secure ComputationPublished by Springer Nature ,1999
- Comparing information without leaking itCommunications of the ACM, 1996
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Founding crytpography on oblivious transferPublished by Association for Computing Machinery (ACM) ,1988
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972