.NET Project On Secure Mining of Association Rules in Horizontally Distributed Databases


We  propose a protocol for at secure mining of association guidelines in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton . Our protocol, like theirs, is based totally on the Fast distributed Mining (FDM)set of rules of Cheung et al. , which is an unsecured disbursed model of the Apriori algorithm. The primary ingredients in our protocol are two novel secure multi-party algorithms-one which computes the union of private subsets that each of the interacting players keep, and any other that tests the inclusion of an detail held by using one player in a subset held by means of some other. Our protocol gives more desirable privacy with recognize to the protocol in . In addition, it’s far easier and significantly more efficient in phrases of communication rounds, communication cost and computational cost.

Leave a Reply

Your email address will not be published. Required fields are marked *