Privacy Preserved Mining of Association Rules Over Horizontally Partitioned Data

Santhi. Siruvuri, A. Jagan

Abstract


In this paper, we survey the basic fundamental paradigms and notions of secure multiparty computation to the field of privacy-preserving data mining. Additionally reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient protocols. The main ingredients in the protocol are two new secure multi-party algorithms one who reckon the particular abutment connected with non-public subsets that every one of the interacting parties cling on and another that test the admittance of an element placed by one particular party in a very subset placed by another. We tend to analyze the performance of secure implementations of the efficient protocols.

Keywords: Data mining; multi party computation; association rules and privacy


Full Text:

PDF




Copyright (c) 2016 Santhi. Siruvuri, A. Jagan

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Publisher

EduPedia Publications Pvt Ltd, D-351, Prem Nagar-2, Suleman Nagar, Kirari, Nagloi, New Delhi PIN-Code 110086, India Through Phone Call us now: +919958037887 or +919557022047

All published Articles are Open Access at https://edupediapublications.org/journals/


Paper submission: editor@edupediapublications.com or edupediapublications@gmail.com

Editor-in-Chief       editor@edupediapublications.com

Mobile:                  +919557022047 & +919958037887

Websites   https://edupediapublications.org/journals/.

Journals Maintained and Hosted by

EduPedia Publications (P) Ltd in Association with Other Institutional Partners

http://edupediapublications.org/

Pen2Print and IJR are registered trademark of the Edupedia Publications Pvt Ltd.