Privacy Preserving Secure Data Mining of Association Rules in Horizontally in Distributed Computation Databases

Abstract

We propose a protocol for secure mining of association rules in horizontally distributed databases. Our protocol, like theirs, is predicated on the quick Distributed Mining FDM rule that is Associate in unsecured distributed version of the Apriori rule. the most ingredients in our protocol area unit Two novel secure multi-party algorithms ,one that computes the union of personal subsets that every of the interacting players hold, and another that tests the inclusion of part command by one player in an exceedingly set command by another. Our protocol offers increased privacy with regard to the protocol. Additionally, it's easier and is considerably additional economical in terms of communication rounds, communication value and procedure value.