文件名称:WWWWW
介绍说明－－下载内容均来自于网络，请自行研究使用
We propose a protocol for secure mining of association rules in horizontally distributed s. 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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Secure_Mining_of_Association_Rules_in_Horizontally_Distributed_Databases.pdf