By Topic

Towards a Collusion-Resistant Algebraic Multi-Party Protocol for Privacy-Preserving Association Rule Mining in Vertically Partitioned Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Trincà†, D. ; Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT ; Rajasekaran, S.

Privacy-preserving data mining has recently become an attractive research area, mainly due to its numerous applications. Within this area, privacy-preserving association rule mining has received considerable attention, and most algorithms proposed in the literature have focused on the case when the database to be mined is distributed, usually horizontally or vertically. In this paper, we focus on the case when the database is distributed vertically, and propose an efficient multi-party protocol for evaluating item-sets that preserves the privacy of the individual parties. The proposed protocol is algebraic and recursive in nature, and is based on a recently proposed two-party protocol for the same problem. It is not only shown to be much faster than similar protocols, but also more secure. We also present a variant of the protocol that is resistant to collusion among parties.

Published in:

Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa

Date of Conference:

11-13 April 2007