{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T22:03:56Z","timestamp":1769033036903,"version":"3.49.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62172307, 62202339, 62325209"],"award-info":[{"award-number":["62172307, 62202339, 62325209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"New 20 Project of Higher Education of Jinan","award":["202228017"],"award-info":[{"award-number":["202228017"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2042023KF0203, 2042024kf1013"],"award-info":[{"award-number":["2042023KF0203, 2042024kf1013"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2026,5,31]]},"abstract":"<jats:p>\n                    Clustering algorithms, as the core technology in data analysis, can extract potential patterns and regularities from complex data. However, deploying\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -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\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -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.\n                  <\/jats:p>","DOI":"10.1145\/3774426","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T11:23:18Z","timestamp":1762168998000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure and Dropout-Resilient Three-Party Clustering Based on Cloud-Edge-Client Collaboration"],"prefix":"10.1145","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7220-5246","authenticated-orcid":false,"given":"Hong","family":"Qin","sequence":"first","affiliation":[{"name":"Wuhan University","place":["Wuhan, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2446-7436","authenticated-orcid":false,"given":"He","family":"Debiao","sequence":"additional","affiliation":[{"name":"Wuhan University","place":["Wuhan, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-7855","authenticated-orcid":false,"given":"Qi","family":"Feng","sequence":"additional","affiliation":[{"name":"Wuhan University","place":["Wuhan, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1819-9332","authenticated-orcid":false,"given":"Min","family":"Luo","sequence":"additional","affiliation":[{"name":"Wuhan University","place":["Wuhan, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Biljana L. Risteska Stojkoska and Kire V. Trivodaliev. 2017. A review of Internet of Things for smart home: Challenges and solutions. Journal of Cleaner Production 140 3 (2017) 1454\u20131464.","DOI":"10.1016\/j.jclepro.2016.10.006"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2320093"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.23919\/cje.2021.00.411"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2050-4"},{"key":"e_1_3_1_6_2","volume-title":"The Future of Intelligent Transport Systems","author":"Dimitrakopoulos George J.","year":"2020","unstructured":"George J. Dimitrakopoulos, Lorna Uden, and Iraklis Varlamis. 2020. The Future of Intelligent Transport Systems. Elsevier."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.23919\/cje.2022.00.071"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/1202390"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98734-7"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2017.8024510"},{"issue":"10","key":"e_1_3_1_11_2","doi-asserted-by":"crossref","first-page":"3424","DOI":"10.1109\/TKDE.2020.2969633","article-title":"Secure and efficient outsourced k-means clustering using fully homomorphic encryption with ciphertext packing technique","volume":"33","author":"Wu Wei","year":"2020","unstructured":"Wei Wu, Jian Liu, Huimei Wang, Jialu Hao, and Ming Xian. 2020. Secure and efficient outsourced k-means clustering using fully homomorphic encryption with ciphertext packing technique. IEEE Transactions on Knowledge and Data Engineering 33, 10 (2020), 3424\u20133437.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Yongkai Fan Jianrong Bai Xia Lei Weiguo Lin Qian Hu Guodong Wu Jiaming Guo and Gang Tan. 2021. PPMCK: Privacy-preserving multi-party computing for K-means clustering. Journal of Parallel and Distributed Computing 154 1 (2021) 54\u201363.","DOI":"10.1016\/j.jpdc.2021.03.009"},{"issue":"2","key":"e_1_3_1_13_2","first-page":"124","article-title":"k-means clustering method preserving differential privacy in map reduce framework","volume":"37","author":"Li Hongcheng","year":"2016","unstructured":"Hongcheng Li, XP Wu, and Yan Chen. 2016. k-means clustering method preserving differential privacy in map reduce framework. Journal on Communications 37, 2 (2016), 124\u2013130.","journal-title":"Journal on Communications"},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Chang Xia Jingyu Hua Wei Tong and Sheng Zhong. 2020. Distributed K-means clustering guaranteeing local differential privacy. Computers and Security 90 1 (2020) 101699.","DOI":"10.1016\/j.cose.2019.101699"},{"issue":"5","key":"e_1_3_1_15_2","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TKDE.2018.2847662","article-title":"PrivateGraph: Privacy-preserving spectral analysis of encrypted graphs in the cloud","volume":"31","author":"Sharma Sagar","year":"2018","unstructured":"Sagar Sharma, James Powers, and Keke Chen. 2018. PrivateGraph: Privacy-preserving spectral analysis of encrypted graphs in the cloud. IEEE Transactions on Knowledge and Data Engineering 31, 5 (2018), 981\u2013995.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.3390\/e24081145"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315306"},{"issue":"1","key":"e_1_3_1_20_2","first-page":"1","article-title":"Communication-efficient privacy-preserving clustering","volume":"3","author":"Jagannathan Geetha","year":"2010","unstructured":"Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright, and Daryl Umano. 2010. Communication-efficient privacy-preserving clustering. Transactions on Data Privacy 3, 1 (2010), 1\u201325.","journal-title":"Transactions on Data Privacy"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13601-6_17"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36071-8_33"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28419"},{"key":"e_1_3_1_24_2","article-title":"Sok: Efficient privacy-preserving clustering","author":"Hegde Aditya","year":"2021","unstructured":"Aditya Hegde, Helen M\u00f6llering, Thomas Schneider, and Hossein Yalame. 2021. Sok: Efficient privacy-preserving clustering. Cryptology ePrint Archive.","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Payman Mohassel Mike Rosulek and Ni Trieu. 2020. Practical privacy-preserving k-means clustering. In Proceedings on Privacy Enhancing Technologies 4 4 (2020) 414\u2013433.","DOI":"10.2478\/popets-2020-0080"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3433210.3453104"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3133201"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2017.64"},{"issue":"4","key":"e_1_3_1_31_2","first-page":"1541","article-title":"Differentially private k-means clustering with convergence guarantee","volume":"18","author":"Lu Zhigang","year":"2020","unstructured":"Zhigang Lu and Hong Shen. 2020. Differentially private k-means clustering with convergence guarantee. IEEE Transactions on Dependable and Secure Computing 18, 4 (2020), 1541\u20131552.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_1_32_2","doi-asserted-by":"crossref","unstructured":"Mengmeng Yang Ivan Tjuawinata and Kwok-Yan Lam. 2022. K-means clustering with local d-privacy for privacy- preserving data analysis. IEEE Transactions on Information Forensics and Security 17 1 (2022) 2524\u20132537.","DOI":"10.1109\/TIFS.2022.3189532"},{"key":"e_1_3_1_33_2","unstructured":"Ronald L. Rivest Len Adleman and Michael L. Dertouzos. 1978. On data banks and privacy homomorphisms. Foundations of Secure Computation 4 11 (1978) 169\u2013180."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590332"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2015.20"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2695487"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-019-00711-w"},{"issue":"3","key":"e_1_3_1_39_2","first-page":"2348","article-title":"Privacy-preserving and outsourced multi-party k-means clustering based on multi-key fully homomorphic encryption","volume":"20","author":"Zhang Peng","year":"2023","unstructured":"Peng Zhang, Teng Huang, Xiaoqiang Sun, Wei Zhao, Hongwei Liu, Shangqi Lai, and Joseph K. Liu. 2023. Privacy-preserving and outsourced multi-party k-means clustering based on multi-key fully homomorphic encryption. IEEE Transactions on Dependable and Secure Computing 20, 3 (2023), 2348\u20132359.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_1_40_2","first-page":"468","volume-title":"Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques","author":"Brickell Ernest F.","year":"1989","unstructured":"Ernest F. Brickell. 1989. Some ideal secret sharing schemes. In Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 468\u2013475."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.5555\/646756.705383"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560697"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64322-8_12"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"e_1_3_1_45_2","doi-asserted-by":"crossref","unstructured":"Sameer Wagh Shruti Tople Fabrice Benhamouda Eyal Kushilevitz Prateek Mittal and Tal Rabin. 2021. Falcon: Honest majority maliciously secure framework for private deep learning. In Proceedings on Privacy Enhancing Technologies 2021 1 (2021). 188\u2013208.","DOI":"10.2478\/popets-2021-0011"},{"key":"e_1_3_1_46_2","unstructured":"Lushan Song and Zhexuan Wang. 2022. pMPL. [Online]. Retrieved from https:\/\/github.com\/FudanMPL\/pMPL. [2024-9-20]."},{"key":"e_1_3_1_47_2","first-page":"129","volume-title":"Proceedings of the 6th IFIP International Conference on Trust Management","author":"Patel Sankita","year":"2012","unstructured":"Sankita Patel, Sweta Garasia, and Devesh Jinwala. 2012. An efficient approach for privacy preserving distributed k-means clustering based on shamir\u2019s secret sharing schem. In Proceedings of the 6th IFIP International Conference on Trust Management. 129\u2013141."},{"key":"e_1_3_1_48_2","first-page":"655","volume-title":"Proceedings of the International Conference on Frontiers in Cyber Security","author":"Wang Chen","year":"2023","unstructured":"Chen Wang, Jian Xu, Shanru Tan, and Long Yin. 2023. Privacy-preserving cloud-edge collaborative k-means clustering model in IoT. In Proceedings of the International Conference on Frontiers in Cyber Security. Springer, 655\u2013669."},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120687"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-023-4013-x"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:20:07Z","timestamp":1768980007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,5,31]]}},"alternative-id":["10.1145\/3774426"],"URL":"https:\/\/doi.org\/10.1145\/3774426","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"2025-04-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}