Abstract
Preserving Privacy is crucial in distributed environments wherein data mining becomes a collaborative task among participants. Solutions proposed on the lines of cryptography involve use of classical cryptographic constructs in data mining algorithms. Applicability of solutions proposed depends on the adversary model in which it is able to preserve privacy. Existing cryptography based solutions for privacy preserving clustering aim to achieve privacy in presence of semi honest adversary model. For the practical applicability of the solutions in real world settings, support of malicious adversary model is desirable. As per our literature survey, the existing research lacks any fool proof solution for privacy preserving distributed clustering in malicious adversary model. In this paper, we propose privacy preserving distributed K-Means clustering of horizontally partitioned data that supports privacy in malicious adversarial model. The basic construct involves use of secret sharing mechanism clubbed with code based zero knowledge identification scheme. We use secret sharing for privately sharing the information and code based identification scheme to add support against malicious adversaries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kriegel, H.P., Borgwardt, K.M., Kröger, P., Pryakhin, A., Schubert, M., Zimek, A.: Future trends in data mining. Data Mining and Knowledge Discovery 15(1), 87–97 (2007)
Patel, S., Garasia, S., Jinwala, D.: An Efficient Approach for Privacy Preserving Distributed K-Means Clustering Based on Shamir’s Secret Sharing Scheme. In: Dimitrakos, T., Moona, R., Patel, D., McKnight, D.H. (eds.) Trust Management VI. IFIP AICT, vol. 374, pp. 129–141. Springer, Heidelberg (2012)
Agrawal, R., Srikant, R.: Privacy-preserving data mining. ACM SIGMOD 29(2), 439–450 (2000)
Lindell, Y.: Privacy Preserving Data Mining. J. Cryptology, IACR, 177–206 (2002)
Pinkas, B.: Cryptographic Techniques for Privacy Preserving Data Mining. SIGKDD Explorations 4(2), 12–19 (2002)
Wu, X., Chu, C.-H., Wang, Y., Liu, F., Yue, D.: Privacy Preserving Data Mining Research: Current Status and Key Issues. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007, Part III. LNCS, vol. 4489, pp. 762–772. Springer, Heidelberg (2007)
Lloyd, S.P.: Least squares quantization in PCM. IEEE Transactions on Information Theory 28, 129–137 (1982)
Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proc. 9th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining. ACM Press (2003)
Inan, A., Kaya, S.V., Saygin, Y., Savas, E., Hintoglu, A.A., Levi, A.: Privacy preserving clustering on horizontally partitioned data. Data Knowl. Eng., 646–666 (2007)
Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proc. KDD, pp. 593–599 (2005)
Bunn, P., Ostrovsky, R.: Secure two-party k-means clustering. In: Proc. ACM Conference on Computer and Communications Security, pp. 486–497 (2007)
Jha, S., Kruger, L., McDaniel, P.: Privacy Preserving Clustering. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 397–417. Springer, Heidelberg (2005)
Upmanyu, M., Namboodiri, A.M., Srinathan, K., Jawahar, C.V.: Efficient Privacy Preserving K-Means Clustering. In: Chen, H., Chau, M., Li, S.-h., Urs, S., Srinivasa, S., Wang, G.A. (eds.) PAISI 2010. LNCS, vol. 6122, pp. 154–166. Springer, Heidelberg (2010)
Doganay, M.C., Pedersen, T.B., Saygin, Y., Savas, E., Levi, A.: Distributed privacy preserving k-means clustering with additive secret sharing. In: Proc. 2008 International Workshop on Privacy and Anonymity in Information Society, Nantes, France, pp. 3–11 (2008)
Kantarcioglu, M., Kardes, O.: Privacy-preserving data mining in the malicious model. International Journal of Information and Computer Security 2(4), 353–375 (2008)
Lindell, Y., Pinkas, B.: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 52–78. Springer, Heidelberg (2007)
Lindell, Y., Pinkas, B., Smart, N.: Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 2–20. Springer, Heidelberg (2008)
Zhan, J., Chang, L., Matwin, S.: How to Prevent Private Data from being Disclosed to a Malicious Attacker, Learning. In: Lin, T.Y., Xie, Y., Wasilewska, A., Liau, C.-J. (eds.) Data Mining: Foundations and Practice. SCI, vol. 118, pp. 517–528. Springer, Heidelberg (2008)
Emura, K., Miyaji, A., Rahman, M.S.: Efficient Privacy-Preserving Data Mining in Malicious Model. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol. 6440, pp. 370–382. Springer, Heidelberg (2010)
Gilburd, B., Schuster, A., Wolff, R.: Privacy-preserving data mining on data grids in the presence of malicious participants. In: Proc. of HPDC 2004, Honolulu, Hawaii (June 2004)
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)
Duan, Y., Canny, J.: Practical private computation and zero-knowledge tools for privacy-preserving distributed data mining, In: SDM 2008 (2008)
Shah, D., Zhong, S.: Two methods for privacy preserving data mining with malicious participants. Information Sciences 177(23), 5468–5483 (2008)
Lindell, Y., Pinkas, B.: Secure Two-Party Computation via Cut-n-Choose Oblivious Transfer. International Association for Cryptologic Research (2011)
Duan, Y., Canny, J.F., Zhan, J.Z.: Efficient Privacy-Preserving Association Rule Mining: P4P Style. In: Proc. CIDM, pp. 654–660 (2007)
Feige, U., Fiat, A., Shamir, A.: Zero Knowledge Proofs of Identity. Computing, 210-217 (1987)
Bernstein, D.J., Buchman, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)
Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M.: A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 171–186. Springer, Heidelberg (2011)
Oliveira, S.R.M.: Privacy preserving clustering by data transformation. In: Proc.18th Brazilian Symposium on Databases, pp. 304–318 (2003)
Goldreich, O.: Foundations of Cryptography. Cambridge University Press (2001)
De Santis, A., Di Crescenzo, G., Persiano, G.: Secret Sharing and Perfect Zero-Knowledge. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 73–84. Springer, Heidelberg (1994)
Pedersen, T.B., Saygin, Y., Savas, E.: Secret sharing vs. encryption-based techniques for privacy preserving data mining. In: Proc. UNECE/Eurostat Work Session on SDC (2007)
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patel, S., Patel, V., Jinwala, D. (2013). Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Zero Knowledge Proof. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)