A Protocol for Secure Mining of Association principle in HDDs based on QDM

Abstract

We propose a protocol for secure mining of association principles in horizontally distributed databases. This leading protocol is that of Kantarcioglu and Clifton. Our protocol, like theirs, relies on the quick Distributed Mining (QDM) formula of Cheung et al. that is associate unsecured distributed version of the Apriori principle. The most ingredients in our protocol are two novel secure multi-party algorithms one that computes the union of personal subsets that every of the interacting group of actors hold, and second one that tests the coupling of a component control by one actor in an exceedingly set control by another.
Key-Terms: Privacy protective Data processing; Distribute Calculation; Regular Item Sets; Association Principles