ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Data & Knowledge Engineering
Volume 63, Issue 2, November 2007, Pages 550-567
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (559 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.datak.2007.04.001    How to Cite or Link Using DOI (Opens New Window)
Crown copyright © 2007 Published by Elsevier B.V.

Privacy-preserving distributed association rule mining via semi-trusted mixer

Xun YiCorresponding Author Contact Information, a, E-mail The Corresponding Author and Yanchun Zhanga, E-mail The Corresponding Author

aSchool of Computer Science and Mathematics, Victoria University, P.O. Box 14428, Melbourne City MC, Victoria 8001, Australia

Received 14 December 2006; 
revised 20 March 2007; 
accepted 5 April 2007. 
Available online 19 April 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Distributed data mining applications, such as those dealing with health care, finance, counter-terrorism and homeland defence, use sensitive data from distributed databases held by different parties. This comes into direct conflict with an individual’s need and right to privacy. In this paper, we come up with a privacy-preserving distributed association rule mining protocol based on a new semi-trusted mixer model. Our protocol can protect the privacy of each distributed database against the coalition up to n − 2 other data sites or even the mixer if the mixer does not collude with any data site. Furthermore, our protocol needs only two communications between each data site and the mixer in one round of data collection.

Keywords: Privacy-preserving distributed data mining; Data security

PACS classification codes: 07.05.Kf

Article Outline

1. Introduction
2. Backgrounds
2.1. Association rule mining
2.2. Apriori algorithm
2.3. Paillier encryption algorithm
3. Privacy-preserving distributed association rule mining via a semi-trusted mixer
3.1. Semi-trusted mixer model
3.2. Our protocol
3.2.1. Finding candidate items
3.2.2. Finding frequent itemsets
3.2.3. Construction of association rules
4. Security analysis
5. Performance analysis
5.1. Performance of our protocol
5.2. Performance improvement
5.3. Performance comparison
5.4. Implementation
6. Conclusion
References
Vitae





Data & Knowledge Engineering
Volume 63, Issue 2, November 2007, Pages 550-567
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.