The goal of data mining is to extract or mine knowledge from large amounts of data. Privacy, legal and commercial concerns restrict centralized access to this data. Theoretical results from the area of secure multiparty computation in cryptography prove that assuming the existence of trapdoor permutations, one may provide secure protocols for any two-party computation as well as for any multiparty computation with honest majority.

Download PDF

References

1. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys, 21(4):515–556, December 1989.
2. Information sharing across private databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, San Diego, CA, June 9-12 2003.
3. Ramakrishnan Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pages 439–450, Dallas, TX, May 14-19 2000.
4. V. Verykios. Disclosure limitation of sensitive rules. In Knowledge and Data Engineering Exchange Workshop (KDEX‟99), pages 25–32, Chicago, IL, November 8 1999.
5. K. Yelick. Runtime Support for Portable Distributed Data Structures. Workshop on Languages, Compilers, and Runtime Systems for Scalable Computers, May 1995.
6. Consistent Linear Speedups to a First Solution in Parallel StateSpace Search. In Proceedings of the 1990 National Conf. on Artificial Intelligence AAAI-90, July 1990.

Back