Efficient Privacy-Preserving Data Mining in Malicious Model
In many distributed data mining settings, disclosure of the original data sets is not acceptable due to privacy concerns. To address such concerns, privacy-preserving data mining has been an active research area in recent years. While confidentiality is a key issue, scalability is also an important aspect to assess the performance of a privacy-preserving data mining algorithms for practical applications. With this in mind, Kantarcioglu et al. proposed secure dot product and secure set-intersection protocols for privacy-preserving data mining in malicious adversarial model using zero knowledge proofs, since the assumption of semi-honest adversary is unrealistic in some settings. Both the computation and communication complexities are linear with the number of data items in the protocols proposed by Kantarcioglu et al. In this paper, we build efficient and secure dot product and set-intersection protocols in malicious model. In our work, the complexity of computation and communication for proof of knowledge is always constant (independent of the number of data items), while the complexity of computation and communication for the encrypted messages remains the same as in Kantarcioglu et al.’s work (linear with the number of data items). Furthermore, we provide the security model in Universal Composability framework.
KeywordsPrivacy-preserving Data Mining Malicious Model Threshold Two-party Computation Efficiency
Unable to display preview. Download preview PDF.
- 2.Bunn, P., Ostrovsky, R.: Secure Two-Party k-Means Clustering. In: ACM CCS 2007, pp. 486–497 (2007)Google Scholar
- 6.Galindo, D., Libert, B., Fischlin, M., Fuchsbauer, G., Lehmann, A., Manulis, M., Schroder, D.: Public-Key Encryption with Non-interactive Opening: New Constructions and Stronger Definitions. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 333–350. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 7.Hazay, C., Nissim, K.: Efficient Set Operations in the Presence of Malicious Adversaries. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 312–331. Springer, Heidelberg (2010)Google Scholar
- 8.Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 593–599 (2005)Google Scholar
- 16.Su, C., Bao, F., Zhou, J., Takagi, T., Sakurai, K.: Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes. IEICE Trans. Fundamentals E92-A(4), 1246–1250 (2009)Google Scholar
- 17.Top 10 Largest Databases in the World, http://www.worldsbiggests.com/2010/02/top-10-largest-databases-in-world.html
- 18.Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639–644 (2002)Google Scholar