Published In : IJCSN Journal Volume 5, Issue 5

Date of Publication : October 2016

Pages : 728-733

Figures :04

Tables : --

 

Vinay Bamane : received B.E degree in Computer Science and Engineering from Dr.Babasaheb Ambedkar, Maratwada University of Aurangabad, Post Graduation diploma in CDAC (Head Office) from Barti Pune, Master of Business Administration in Human Resource from Y.C.M.O.U Nashik and pursuing the M.E. degree in Computer Science and Engineering in Nagesh Karajagi Orchid College of Engineering & Technology, Solapur, India. He is doing her dissertation work under the guidance of Mr. Vipul Bag Associate Professorat Nagesh Karajagi Orchid College of Engg. & Technology, Solapur, Maharashtra, India.

Vipul Bag : is working as Assosiate Professor in Department of Computer Science and Engineering in NK Orchid College of Engineering and Technology, Solapur, Maharashtra, India. He has 17 years of teaching experience. He has co-authored over 20 International Journal Publications. He is pursuing PhD from SGGSIET, Nanded, Maharashtra, India. The current research interests are Recommendation systems, Data Mining and Machine Learning.

 

 

 

 

 

 

 

Data Mining, FDM Distributed Computation, Frequent Itemsets, Association Rule, Privacy Preserving

This paper proposed a new rule for secure mining in horizontally distributed databases that improves drastically upon the current leading procedure in terms of retreat and competence.

 

[1] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules in Large Databases,” Proc 20th Int’l Conf. Very Large Data Bases (VLDB), pp. 487-499, 1994. [2] M. Kantarcioglu and C. Clifton, “Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data,”IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, pp. 1026- 1037,Sept. 2004. [3] D. Beaver, S. Micali, and P. Rogaway, “The Round Complexity of Secure Proposed rules,” Proc. 22nd Ann. ACM Symp. Theory of Computing (STOC), pp. 503-513, 1990. [4] M. Bellare, R. Canetti, and H. Krawczyk, “Keying Hash Functions for Message Authentication,” Proc. 16th Ann. Int’l Cryptology Conf. Advances in Cryptology (Crypto), pp. 1-15, 1996. [5] A. Ben-David, N. Nisan, and B. Pinkas, “FairplayMP - A System for Secure Multi-Party Computation,” Proc. 15th ACM Conf. Computer and Comm. Security (CCS), pp. 257-266, 2008. [6] J.C. Benaloh, “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret,” Proc. Advances in Cryptology (Crypto), pp. 251-260, 1986. [7] 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), pp. 236-252, 2005. [8] D.W.L. Cheung, J. Han, V.T.Y. Ng, A.W.C. Fu, and Y. Fu, “A Fast Distributed Algorithm for Mining Association Rules,” Proc. Fourth Int’l Conf. Parallel and Distributed Information Systems (PDIS), pp. 31- 42, 1996. [9] 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.Knowledge and Data Eng., vol. 8, no. 6, Dec. 1996. [10] T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory,vol. IT-31, no. 4, July 1985. [11] A.V. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy Preserving Mining of Association Rules,” Proc. Eighth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD),pp. 217-228, 2002. [12] R. Fagin, M. Naor, and P. Winkler, “Comparing Information without Leaking It,” Comm. ACM, vol. 39, pp. 77-85, 1996. [13] M. Freedman, Y. Ishai, B. Pinkas, and O. Reingold, “Keyword Search and Oblivious Pseudorandom Functions,” Proc. Second Int’l Conf. Theory of Cryptography (TCC), pp. 303-324, 2005.