Title: Privacy preserving association rule mining based on homomorphic computations

Authors: V. Baby; N. Subhash Chandra

Addresses: Department of Computer Science and Engineering, VNR Vignana Jyothi Inst of Engg and Technology, Hyderabad – 500090, India ' Department of Computer Science and Engineering, CVR College of Engineering, Hyderabad – 501510, India

Abstract: Privacy-preserving data mining (PPDM) techniques allow the knowledge extraction from data, while privacy preserving in data mining applications. Many of the researchers have recently made an effort to preserve privacy of sensitive knowledge or information in a real database. Association rule mining and frequent item-set mining are two popular and widely studied data analysis techniques for a range of applications. To ensure data privacy, in this paper, we design an efficient homomorphic encryption-based scheme for privacy preserving data mining. The main issues with some of the known privacy preserving methods are - high computational complexity and large communication cost required for their execution. Our methods provide perfect secrecy and resist various attacks to some extent in association rule mining process. We presented correctness, security analysis and experimental results for the proposed system. We also presented the comparison of our proposed method with other significant state of the art methods.

Keywords: security; association rule mining; homomorphic encryption; distributed computation; transactional itemsets.

DOI: 10.1504/IJIPSI.2018.096135

International Journal of Information Privacy, Security and Integrity, 2018 Vol.3 No.4, pp.268 - 283

Available online: 13 Nov 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article