Privacy preserving mining of association rules on horizontally distributed databases

Alborzi, SZ, Raji, F and Saraee, MH ORCID: https://orcid.org/0000-0002-3283-1912 2012, Privacy preserving mining of association rules on horizontally distributed databases , in: International Conference on Software and Computer Applications ICSCA 2012, 9-10 June, 2012, Singapore.

PDF - Published Version Restricted to Repository staff only Download (863kB) | Request a copy

Abstract

These protocols are based on two main approaches named as: the Randomization approach and the Cryptographic approach. The first one is based on perturbation of the valuable information while the second one uses cryptographic techniques. The randomization approach is much more efficient with reduced accuracy while the cryptographic approach can provide solutions with perfect accuracy. However, the cryptographic approach is a much slower method and requires considerable computation and communication overhead. In this paper, a new protocol is proposed which combines the advantages of the two previous approaches to perform privacy preserving in distributed mining of association rules. Both the privacy and performance characteristics of the proposed protocol are studied and compared with the randomization and cryptographic approaches. The approach introduced in this paper has great advantages, such as higher flexibility and resistance against conspiracy, over the similar methods.

Item Type:	Conference or Workshop Item (Paper)
Schools:	Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Journal or Publication Title:	2012 International Conference on Software and Computer Applications (ICSCA 2012)
Publisher:	IACSIT Press, Singapore
Related URLs:	Publisher
Depositing User:	Prof. Mo Saraee
Date Deposited:	12 Jul 2017 08:19
Last Modified:	16 Feb 2022 18:23
URI:	https://usir.salford.ac.uk/id/eprint/42930

Actions (login required)

Edit record (repository staff only)