A new method for privacy preserving association rule mining using homomorphic encryption with a secure communication protocol

被引:4
作者
Zehtabchi, S. [1 ]
Daneshpour, N. [1 ]
Safkhani, M. [1 ,2 ]
机构
[1] Shahid Rajaee Teacher Training Univ, Fac Comp Engn, Tehran, Iran
[2] Inst Res Fundamental Sci IPM, Sch Comp Sci, POB 19395-5746, Tehran, Iran
关键词
Data mining; Privacy; Rule mining; Security; ALGORITHM;
D O I
10.1007/s11276-022-03185-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the enormous amount of data growing exponentially, data owners aim to share data with each other to acquire an enhanced analytic view of their data. Distributed association rule mining over cloud computation helps data owners to extract knowledge from multiple databases. However, privacy is an important concept for data owners who want to share data and extract knowledge from aggregated data. This study proposes an outsourcing method to securely share and mine association rules from multiple parties protecting all parties' privacy. In this research, we utilize the properties of homomorphic encryption and propose a custom secure communication protocol. In our study, privacy of the shared data of all parties is ensured and we will not perform decryption in any step of the proposed method. We show that previous schemes could not properly guarantee the integrity of messages, furthermore, we propose our innovative communication protocol that uses an integrity checking function based on homomorphic encryption to authorize each party's shared data. We have implemented our scheme and showed even though an additional communication burden exists in our method, this method outperforms its competitors in terms of elapsed time and security. We have achieved more security especially in confidentiality and integrity of messages due to use of our proposed secure communication protocol. We also measured our proposed method's precision of mining parameters with different datasets to show the accuracy of our method on different scales will not change.
引用
收藏
页码:1197 / 1212
页数:16
相关论文
共 35 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
Agrawal R., 1994, P 20 INT C VER LARG, P487, DOI DOI 10.5555/645920.672836
[3]  
AndrasJanosi M.D. U.H.Z.S.W.S.M.U.H.B.S.M.P.M.V.M.C.L.B. Cleveland Clinic Foundation: RobertDetrano M.D. P., UCI REPOSITORY MACHI
[4]  
[Anonymous], 2014, ADV DATA MIN DATABAS
[5]   A Light-Weight Permutation based Method for Data Privacy in Mobile Cloud Computing [J].
Bahrami, Mehdi ;
Singhal, Mukesh .
2015 3RD IEEE INTERNATIONAL CONFERENCE ON MOBILE CLOUD COMPUTING, SERVICES, AND ENGINEERING (MOBILECLOUD 2015), 2015, :189-196
[6]   Reversible privacy preserving data mining: a combination of difference expansion and privacy preserving [J].
Chen, Tung-Shou ;
Lee, Wei-Bin ;
Chen, Jeanne ;
Kao, Yuan-Hung ;
Hou, Pei-Wen .
JOURNAL OF SUPERCOMPUTING, 2013, 66 (02) :907-917
[7]   Efficient mining of association rules in distributed databases [J].
Cheung, DW ;
Ng, VT ;
Fu, AW ;
Fu, YJ .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) :911-922
[8]   A Survey of Man In The Middle Attacks [J].
Conti, Mauro ;
Dragoni, Nicola ;
Lesyk, Viktor .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2016, 18 (03) :2027-2051
[9]  
Domadiya Nikunj H., 2018, 2018 IEEE 13th International Conference on Industrial and Information Systems (ICIIS), P217, DOI 10.1109/ICIINFS.2018.8721388
[10]   Privacy-preserving association rule mining for horizontally partitioned healthcare data: a case study on the heart diseases [J].
Domadiya, Nikunj ;
Rao, Udai Pratap .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2018, 43 (08)