Crown copyright © 2007 Published by Elsevier B.V.
Privacy-preserving distributed association rule mining via semi-trusted mixer
Received 14 December 2006;
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
- 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







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






