A Lightweight Mutual Privacy Preserving k-Means Clustering in Industrial IoT

被引:4
|
作者
Hu, Chunqiang [1 ]
Liu, Jianshuo [2 ]
Xia, Hui [3 ]
Deng, Shaojiang [2 ]
Yu, Jiguo [4 ]
机构
[1] Chongqing Univ, Sch Big Data & Software Engn, Chongqing 400030, Peoples R China
[2] Chongqing Univ, Coll Comp Sci, Chongqing 400030, Peoples R China
[3] Ocean Univ China, Coll Comp Sci & Technol, Qingdao 266100, Peoples R China
[4] Qilu Univ Technol, Big Data Inst, Jinan 250316, Peoples R China
基金
中国国家自然科学基金;
关键词
k-means clustering algorithm; privacy preservation; lightweight clustering algorithm; homomorphic encryption; SECURE; COMPUTATION;
D O I
10.1109/TNSE.2023.3337828
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In many industrial Internet of Things application schemes, participants, such as IoT devices, often share information with each others for analysis and categorization purpose. Through the analysis and statistical processing of the information, some necessary information is exchanged, e.g., the attributes in manufacturing IoT devices' gathered data. In this context, many devices are necessarily trusted when sharing information, which raises concerns about data privacy leakage. As the number of IoT devices in the network increases, the scale of pairwise keys increases rapidly. Furthermore, the limitation of device's computing ability makes it hard to perform centralized computing. To address these issues, we propose a light weight k-means clustering scheme that performs clustering with high accuracy, maintaining at a low key management cost, and securing the private attributes of each participant or the intermediate variables. In our proposed scheme, we use aprivate optimal initial cluster center generation algorithm based on attribute weights, in order to achieve the better clustering quality. Secondly, we securely find the nearest clustering center for each participant. We dynamically split and merge clustering centers respectively, in order to meet the optimal clustering result. Last but not least, we calculate the clustering centers without revealing any private attributes about the participants' information during the process. The analysis indicates that our proposed scheme canresist collusion attacks and ensures that the cost of overall pair wisekey management and computation cost performed in data center are relatively low.
引用
收藏
页码:2138 / 2152
页数:15
相关论文
共 50 条
  • [21] Privacy-Preserving k-means Clustering: an Application to Driving Style Recognition
    El Omri, Othmane
    Boudguiga, Aymen
    Izabachene, Malika
    Klaudel, Witold
    NETWORK AND SYSTEM SECURITY, NSS 2019, 2019, 11928 : 685 - 696
  • [22] Outsourced and Privacy-Preserving K-means Clustering Scheme for Smart Grid
    Shen, Xielin
    Yuan, Bo
    Peng, Weiwen
    Qian, Yuanquan
    Wu, Yonghua
    2022 IEEE 10TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND NETWORKS (ICICN 2022), 2022, : 307 - 313
  • [23] Privacy-Preserving Hybrid K-Means
    Gao, Zhiqiang
    Sun, Yixiao
    Cui, Xiaolong
    Wang, Yutao
    Duan, Yanyu
    Wang, Xu An
    INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING, 2018, 14 (02) : 1 - 17
  • [24] Alpha Lightweight Coreset for k-Means Clustering
    Nguyen Le Hoang
    Tran Khanh Dang
    PROCEEDINGS OF THE 2022 16TH INTERNATIONAL CONFERENCE ON UBIQUITOUS INFORMATION MANAGEMENT AND COMMUNICATION (IMCOM 2022), 2022,
  • [25] Online K-Means Clustering with Lightweight Coresets
    Low, Jia Shun
    Ghafoori, Zahra
    Leckie, Christopher
    AI 2019: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, 11919 : 191 - 202
  • [26] K-Means Clustering with Local Distance Privacy
    Yang, Mengmeng
    Huang, Longxia
    Tang, Chenghua
    BIG DATA MINING AND ANALYTICS, 2023, 6 (04) : 433 - 442
  • [27] Locality Preserving Based K-Means Clustering
    Yang, Xiaohuan
    Wang, Xiaoming
    Tian, Yong
    Du, Yajun
    INTELLIGENCE SCIENCE AND BIG DATA ENGINEERING: BIG DATA AND MACHINE LEARNING TECHNIQUES, ISCIDE 2015, PT II, 2015, 9243 : 86 - 95
  • [28] PPMCK: Privacy-preserving multi-party computing for K-means clustering
    Fan, Yongkai
    Bai, Jianrong
    Lei, Xia
    Lin, Weiguo
    Hu, Qian
    Wu, Guodong
    Guo, Jiaming
    Tan, Gang
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2021, 154 (154) : 54 - 63
  • [29] Privacy-Preserving Two-Party k-Means Clustering in Malicious Model
    Akhter, Rahena
    Chowdhury, Rownak Jahan
    Emura, Keita
    Islam, Tamzida
    Rahman, Mohammad Shahriar
    Rubaiyat, Nusrat
    2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW), 2013, : 121 - 126
  • [30] A scalable privacy-preserving recommendation scheme via bisecting k-means clustering
    Bilge, Alper
    Polat, Huseyin
    INFORMATION PROCESSING & MANAGEMENT, 2013, 49 (04) : 912 - 927