Secure Multiparty Protocol for Distributed Mining of Association Rules

M.Manigandan ¹ , K. Aravind Kumar²

Section:Research Paper, Product Type: Isroset-Journal
Vol.3 , Issue.1 , pp.6-10, Jan-2015

Online published on Feb 28, 2015

Copyright © M.Manigandan , K. Aravind Kumar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Association rule mining is one of the data mining tasks to find the association between the items or among the item sets. The privacy concept arises when the database is in the distributed environment in which each database holder is interested to discover the globally supported association rules by participating themselves in mining process without revealing its individual locally supported association rules. The present leading protocol consumes computational overhead as well as communication overhead in order to preserve the privacy in mining. A new protocol is proposed to reduce the communication cost and computational cost for secure mining in homogeneous databases. The proposed protocol uses the secure sum computation and set union computation for determining global association rules. It is significantly more secure and efficient as compared with the existing protocol.

Key-Words / Index Term :
Privacy Preserving Data Mining; Frequent Item Sets; Association Rules; Secure Multiparty Protocol; Distributed Mining; Homogeneous Databases; Secure Sum Computation

References :
[1] R. Agrawal and R. Srikant, “Privacy Preserving Data Mining”, Proc. ACM SIGMOD Conf., pp. 439-450, 2000.
[2] A. Ben-David, N. Nisan, and B. Pinkas, “Fairplay MP - A System for Secure Multiparty Computation”, Proc. 15th ACM Conf. Computer and Comm. Security (CCS), pp.257-266, 2008.
[3] J. Brickell and V. Shmatikov, “Privacy Preserving Graph Algorithms in the Semi-Honest Model”, Proc. 11th Int’l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT), pages 236-252, 2005.
[4] D.W.L Cheung, V.T.Y. Ng, A.W.C. Fu, and Y. Fu. “Efficient Mining of Association Rules in Distributed Databases”, IEEE Trans. Knowl. and Data Eng., Vol.8, No.6, 911-922, 1996.
[5] V. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. “Privacy Preserving Mining of Association Rules”, Proc. Eight ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD), pp.217-228, 2002.
[6] M. J. Freedman, K. Nissim, and B. Pinkas, “Efficient Private Matching and Set Intersection”, Proc. Int’l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT), pp.1-19, 2004.
[7] M. Kantarcioglu and C. Clifton, “Privacy Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data”, IEEE Trans. Knowl. and Data Eng., Vol. 16, No.9, 1026-1037, 2004.
[8] L. Kissner and D.X. Song, “Privacy Preserving Set Operations”, Proc. 25th Ann. Int’l Cryptology Conf. (CRYPTO), pages 241-257, 2005.
[9] A. Schuster, R. Wolff, and B. Gilburd, “Privacy Preserving Association Rule Mining in Large Scale Distributed Systems”, Proc. IEEE Int’l Symp. Cluster Computing and the Grid (CCGRID), pp. 411-¬418, 2004.
[10] Tamir Tassa, “Secure Mining of Association Rules in Horizontally Distributed Database”, IEEE Trans. Knowl. and Data Eng.,Vol.26. No.4, 970-983, 2014.
[11] J. Vaidya and C. Clifton, “Privacy Preserving Association Rule Mining in Vertically Partitioned Data”, Proc. Eight ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD), pp.639-644, 2002.