Secure Multiparty Computation Methods
The problem of preserving privacy while allowing data analysis can be attacked in many ways. One way is to avoid disclosing data beyond its source while still constructing data mining models equivalent to those that would have been learned on an integrated data set. This follows the approach of Secure Multiparty Computation (SMC). SMC refers to the general problem of computing a given function securely over private inputs while revealing nothing extra to any party except what can be inferred (in polynomial time) from its input and output. Since one can prove that data are not disclosed beyond its original source, the opportunity for misuse is not increased by the process of data mining.
The definition of privacy followed in this line of research is conceptually simple: no site should learn anything new from the processof data mining. Specifically, anything learned during the data mining process must be derivable given one’s own data and the final result. In other words,...
- 1.Agrawal R, Srikant R. Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 439–50.Google Scholar
- 2.Du W, Zhan Z. Building decision tree classifier on private data. In: Clifton C, Estivill-Castro V, editors. Proceedings of the IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining; 2002. p. 1–8.Google Scholar
- 3.Freedman MJ, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Proceedings of the International Conference on Theory and Application of Cryptographic Techniques; 2004.Google Scholar
- 4.Goethals B, Laur S, Lipmaa H, Mielikäinen T. On secure scalar product computation for privacy-preserving data mining. In: Proceedings of the 7th Annual International Conference in Information Security and Cryptology; 2004. p. 104–20.Google Scholar
- 6.Goldreich O, Micali S, Wigderson A. How to play any mental game – a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing; 1987. p. 218–29.Google Scholar
- 10.Naor M, Pinkas B. Oblivious transfer and polynomial evaluation. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing; 1999. p. 245–54.Google Scholar
- 11.Paillier P. Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the International Conference on Theory and Application of Cryptographic Techniques; 1999. p. 223–38.Google Scholar
- 12.Vaidya J, Clifton C. Privacy-preserving outlier detection. In: Proceedings of the 4th IEEE International Conference on Data Mining; 2004. p. 233–240.Google Scholar
- 14.Vaidya J, Clifton C, Zhu M. Privacy-preserving data mining. In: Advances in information security, vol. 19. 1st ed. Berlin: Springer; 2005.Google Scholar
- 15.Yao AC. How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science; 1986. p. 162–7.Google Scholar