K-anonymity privacy-preserving algorithm for IoT applications in virtualization and edge computing

被引:5
作者
Ling, Chen [1 ]
Zhang, Weizhe [1 ,2 ]
He, Hui [1 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Xidazhi St, Harbin, Peoples R China
[2] Peng Cheng Lab, Cyberspace Secur Res Ctr, Shenzhen, Peoples R China
来源
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS | 2023年 / 26卷 / 02期
关键词
Privacy-preserving; K-anonymity; Edge computing; Data protection; IoT application; SMART; MODEL;
D O I
10.1007/s10586-022-03755-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Efficient privacy-preserving algorithms are used in internet of things (IoT) applications, virtualization and edge computing environments to decrease the high data disclosure risk. However, due to the strict security principles of current privacy-preserving algorithms, they ignore the time consumption. On the other hand, most existing privacy-preserving algorithms suffer from the overgeneralization problem, creating unnecessary information loss. Thus, two privacy-preserving algorithms are proposed in this paper for IoT applications in the virtualization and edge computing environment to address this problem and balance the information loss and disclosure risk. We first propose an overall metric to measure the performance of privacy-preserving algorithms and balance the information loss and disclosure risk. Second, the proposed algorithms can significantly decrease the time consumption by utilizing cached anonymized datasets. Moreover, the proposed algorithms also optimize the distribution of anonymized datasets and decrease the information loss by deleting the small equivalent classes. Experimental results show that our proposed algorithms are relatively fast, only consuming 34.3% operation time of current algorithms. Next, we tested the usability of anonymized datasets by putting them into an IoT application. The two datasets generate similar results, indicating that the proposed algorithms can satisfy the information loss requirements of IoT applications.
引用
收藏
页码:1495 / 1510
页数:16
相关论文
共 46 条
[1]  
Almohaimeed A., 2019, 2019 IEEE LONG ISL S, P1, DOI DOI 10.1109/LISAT.2019.8817349
[2]   Low-cost Security for Next-generation IoT Networks [J].
Anagnostopoulos, Nikolaos Athanasios ;
Ahmad, Saad ;
Arul, Tolga ;
Steinmetzer, Daniel ;
Hollick, Matthias ;
Katzenbeisser, Stefan .
ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2020, 20 (03)
[3]  
Bayardo RJ, 2005, PROC INT CONF DATA, P217
[4]   Wind power generation fault diagnosis based on deep learning model in internet of things (IoT) with clusters [J].
Chen, Fei ;
Fu, Zhongguang ;
Yang, Zhiling .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 6) :14013-14025
[5]   Methods for the de-identification of electronic health records for genomic research [J].
El Emam, Khaled .
GENOME MEDICINE, 2011, 3
[6]   A cost-efficient auto-scaling mechanism for IoT applications in fog computing environment: a deep learning-based approach [J].
Etemadi, Masoumeh ;
Ghobaei-Arani, Mostafa ;
Shahidinejad, Ali .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04) :3277-3292
[7]   Comparison of Privacy-Preserving Models based on a Third-Party Auditor in Cloud Computing [J].
Frej, Mohamed Ben Haj ;
Dichter, Julius ;
Gupta, Navarun .
2019 3RD IEEE INTERNATIONAL CONFERENCE ON CLOUD AND FOG COMPUTING TECHNOLOGIES AND APPLICATIONS (IEEE CLOUD SUMMIT 2019), 2019, :86-91
[8]  
Frej MB, 2018, IEEE ICCE
[9]   Enhancing quality of experience in mobile edge computing using deep learning based data offloading and cyberattack detection technique [J].
Hilal, Anwer Mustafa ;
Alohali, Manal Abdullah ;
Al-Wesabi, Fahd N. ;
Nemri, Nadhem ;
Alyamani, Hasan J. ;
Gupta, Deepak .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2023, 26 (01) :59-70
[10]   cTMvSDN: improving resource management using combination of Markov-process and TDMA in software-defined networking [J].
Javadpour, Amir ;
Wang, Guojun .
JOURNAL OF SUPERCOMPUTING, 2022, 78 (03) :3477-3499