Secure and Dropout-Resilient Three-Party Clustering Based on Cloud-Edge-Client Collaboration
Open Access
- 20 January 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (2) , 1-22
Abstract
Clustering algorithms, as the core technology in data analysis, can extract potential patterns and regularities from complex data. However, deploying k -means clustering on resource-limited devices remains a challenge. Despite the promise of cloud computing, outsourcing data to a remote cloud leads to high latency and privacy risks. Moreover, the stability and speed of cloud can be affected by the state of network and configuration, which leads to computation error. Therefore, we design a secure and dropout-resilient k -means clustering scheme based on cloud-edge-client collaboration architecture. In our scheme, cloud server simply generates multiplication triples in pre-processing phase and can be offline. In online phase, IoT devices secretly share the raw sensing data with three edge servers. Then edge servers accomplish the clustering task interactively. We propose four basic protocols based on vector space secret sharing, including Euclidean distance, comparison, minimum and division protocols. By applying these protocols, we construct a clustering scheme that can tolerate the exit of one edge server and corruption of two edge servers. Since edge servers are generally located in trusted environment, we allow them to reconstruct clustering result and provide low-latency and high-reliability service. We prove that the basic protocols and clustering scheme are secure against semi-honest adversary. We conduct the experiments on two realistic datasets, showing that our scheme has good efficiency and is suitable for practical application.Keywords
Funding Information
- National Natural Science Foundation of China (62172307, 62202339, 62325209)
- New 20 Project of Higher Education of Jinan (202228017)
- Fundamental Research Funds for the Central Universities (2042023KF0203, 2042024kf1013)
This publication has 35 references indexed in Scilit:
- Multi-party privacy-preserving decision tree training with a privileged partyScience China Information Sciences, 2024
- Efficient privacy-preserving outsourced k-means clustering on distributed dataInformation Sciences, 2024
- An efficient deep learning-assisted person re-identification solution for intelligent video surveillance in smart citiesFrontiers of Computer Science, 2022
- $\mathsf {Rabbit}$: Efficient Comparison for Secure Multi-Party Computation2021
- Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits2020
- Distributed K-Means clustering guaranteeing local differential privacyComputers & Security, 2020
- Homomorphically encrypted k-means on cloud-hosted servers with low client-side loadComputing, 2019
- A review of Internet of Things for smart home: Challenges and solutionsJournal of Cleaner Production, 2017
- Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Zero Knowledge Proof2013
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999