Privacy preserving association rule mining based on homomorphic computations. (2018)

• Record Type: Journal Article
• Authors: Baby, V.; Chandra, N. Subhash
• Is Part Of: International journal of information privacy, security and integrity. Volume 3:Number 4(2018)
• Page Start: 268
• Page End: 283
• Publication Date: 2018
• Subjects: security -- association rule mining -- homomorphic encryption -- distributed computation -- transactional itemsets; Computer security -- Periodicals; Computer networks -- Access control -- Periodicals; Information technology -- Security measures -- Periodicals; Data protection -- Periodicals; Privacy, Right of -- Periodicals; 005.805
• Languages: English
• ISSNs: 1741-8496

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.