By Topic

A Privacy Preserving Algorithm for Mining Distributed Association Rules

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

3 Author(s)
Zhu Yu-quan ; Sch. of Comput. Sci. & Telecommun. Eng., Jiangsu Univ., Zhenjiang, China ; Tang Yang ; Chen Geng

For resolving the problem that the existing protocol of secure two-party vector dot product computation has the low efficiency and may disclose the privacy data, a method which is effective to find frequent item sets on vertically distributed data is put forward. The method uses semi-honest third party to participate in the calculation, put the converted data of the parties to a third party to calculate. The results show that compared to the original Vector dot product algorithm, the method can obviously improve the algorithm efficiency and accuracy of the results at the precondition that assured the data privacy of all parties.

Published in:

Computer and Management (CAMAN), 2011 International Conference on

Date of Conference:

19-21 May 2011