This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Secure Mining of Association Rules inHorizontally Distributed Databases
April 2014 (vol. 26 no. 4)
pp. 970-983
Tamir Tassa, Dept. of Math. & Comput. Sci., Open Univ., Ra'anana, Israel
We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton . Our protocol, like theirs, is based on the Fast Distributed Mining (FDM)algorithm of Cheung et al. , 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 . In addition, it is simpler and is significantly more efficient in terms of communication rounds, communication cost and computational cost.
Index Terms:
Protocols,Itemsets,Vectors,Encryption,Association rules,association rules,Privacy preserving data mining,distributed computation,frequent item sets
Citation:
Tamir Tassa, "Secure Mining of Association Rules inHorizontally Distributed Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 4, pp. 970-983, April 2014, doi:10.1109/TKDE.2013.41
Usage of this product signifies your acceptance of the Terms of Use.