Secure Mining of Association Rules in Databases using Distributed Database Algorithm

We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Distribute Database Algorithm. Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm. Which is an unsecured distributed version of the Apriority algorithm? The main ingredients in our protocol are two novel secure multi-party algorithms — one that computes the union of a private subsets that each of the interacting players holds, and another that tests the inclusion of an element held by one player in a separation held by another. Our protocol offers enhanced privacy concerning the protocol. Also it is simpler and is significantly more efficient regarding communication rounds, communication cost, and computational cost