文章基本信息

标题：A Survey on Efficient Protocol for Privacy Preserving Association Rule Mining
本地全文：下载
作者：Prajakta Jaswante ; P. R. Deshmukh
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2015
卷号：4
期号：3
页码：707-710
出版社：Shri Pannalal Research Institute of Technolgy
摘要：We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton [18]. Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al. [8], which is an unsecured distributed version of the Apriori algorithm. The main ingredients in our protocol are two novel secure multi-party algorithms ¡ª one that computes the union of private subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol offers enhanced privacy with respect to the protocol in [18]. In addition, it is simpler and is significantly more efficient in terms of communication rounds, communication cost and computational cost.
关键词：Privacy Preserving Data Mining; Distributed ; Computation; Frequent Itemsets; Association Rules