DocumentCode
260065
Title
Hierarchical Homomorphic Encryption Based Privacy Preserving Distributed Association Rule Mining
Author
Rana, Shubhra ; Thilagam, P. Santhi
Author_Institution
Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol. Karnataka, Surathkal, India
fYear
2014
fDate
22-24 Dec. 2014
Firstpage
379
Lastpage
385
Abstract
Privacy is an important issue in the field of distributed association rule mining, where multiple parties collaborate to perform mining on the collective data. The parties do not want to reveal sensitive data to other parties. Most of the existing techniques for privacy preserving distributed association rule mining suffer from weak privacy guarantees and have a high computational cost involved. We propose a novel privacy preserving distributed association rule mining scheme based on Paillier additive homomorphic cryptosystem. The experimental results demonstrate that the proposed scheme is more efficient and scalable compared to the existing techniques based on homomorphic encryption.
Keywords
cryptography; data mining; data privacy; distributed processing; trees (mathematics); Paillier additive homomorphic cryptosystem; collective data mining; hierarchical homomorphic encryption; high computational cost; pattern count tree; privacy preserving distributed association rule mining scheme; weak privacy guarantees; Algorithm design and analysis; Association rules; Encryption; Itemsets; Privacy; Association rule mining; Homomorphic encryption; Pattern Count Tree; Privacy; Secure Multiparty Computation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology (ICIT), 2014 International Conference on
Conference_Location
Bhubaneswar
Print_ISBN
978-1-4799-8083-3
Type
conf
DOI
10.1109/ICIT.2014.14
Filename
7033354
Link To Document