Implementation, optimization and performance tests of privacy preserving mechanisms in homogeneous collaborative association rules mining

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article focuses on optimization and performance tests of association rules multiparty mining algorithms. We present how to improve Secure Set Union performance by using a Common Decrypting Key for a commutative encryption. We have also improved Secure Set Union making it fully secure in a semi-honest model. As an example of the above mentioned mechanisms application, the article presents new algorithms of mining association rules on horizontally partitioned data with preserving data privacy - CDKSU (Secure Union with Common Decrypting Key) and its fully secure version - CDKRSU (Secure Union with Common Decrypting Key and secure duplicate Removing). Those algorithms are compared with KCS scheme since they are all based on FDM. As far as the performance optimization is concerned, the application of Elliptic Curve Cryptography vs Exponential Cryptography is presented as well. The real, working system implementing given algorithms is subjected to performance tests which results are presented and analyzed. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Gorawski, M., & Siedlecki, Z. (2011). Implementation, optimization and performance tests of privacy preserving mechanisms in homogeneous collaborative association rules mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7044 LNCS, pp. 347–366). https://doi.org/10.1007/978-3-642-25109-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free