PPEC: A Privacy-Preserving, Cost-Effective Incremental Density Peak Clustering Analysis on Encrypted Outsourced Data

被引:0
作者
Yang, Haomiao [1 ,2 ]
Ding, ZiKang [1 ]
Lu, Ruiheng [1 ]
Xiang, Kunlan [1 ]
Li, Hongwei [1 ]
Wu, Dakui [3 ]
机构
[1] Univ Elect Sci & Technol China, Chengdu 611731, Peoples R China
[2] Minist Educ, Key Lab Comp Power Network & Informat Secur, Jinan 250353, Peoples R China
[3] Shanghai Univ, Shanghai 200444, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Cloud computing; Cryptography; Accuracy; Security; Homomorphic encryption; Data privacy; Privacy; Costs; Clustering algorithms; Clustering analysis; privacy preservation; reaching definition; smart contract;
D O I
10.1109/TCC.2025.3541749
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Call detail records (CDRs) provide valuable insights into user behavior, which are instrumental for telecom companies in optimizing network coverage and service quality. However, while cloud computing facilitates clustering analysis on a vast scale of CDR data, it introduces privacy risks. The challenge lies in striking a balance between efficiency, security, and cost-effectiveness in privacy-preserving algorithms. To tackle this issue, we propose a privacy-preserving and cost-effective incremental density peak clustering scheme. Our approach leverages homomorphic encryption and order-preserving encryption to enable direct computations and clustering on encrypted data. Moreover, it employs reaching definition analysis to optimize the execution flow of static tasks, pinpointing the optimal junctures for transitioning between the two types of encryption to reduce communication overhead. Furthermore, our scheme utilizes a game theory-based verification strategy to ascertain the accuracy of the results. This methodology can be effectively deployed on the Ethereum blockchain via smart contracts. A comprehensive security analysis confirms that our scheme upholds both privacy and data integrity. Experimental evaluations substantiate the clustering accuracy, communication load, and computational efficiency of our scheme, thereby validating its viability in real-world applications.
引用
收藏
页码:485 / 497
页数:13
相关论文
共 45 条
[1]   ASTRAEA: A Decentralized Blockchain Oracle [J].
Adler, John ;
Berryhill, Ryan ;
Veneris, Andreas ;
Poulos, Zissis ;
Veira, Neil ;
Kastania, Anastasia .
IEEE 2018 INTERNATIONAL CONGRESS ON CYBERMATICS / 2018 IEEE CONFERENCES ON INTERNET OF THINGS, GREEN COMPUTING AND COMMUNICATIONS, CYBER, PHYSICAL AND SOCIAL COMPUTING, SMART DATA, BLOCKCHAIN, COMPUTER AND INFORMATION TECHNOLOGY, 2018, :1145-1152
[2]  
Aho AV., 1986, Compilers: Principles, Techniques, and Tools
[3]  
Ait Abdelouahid R., 2023, BMC Med. Inform. Decis. Mak., V23, P1
[4]  
Boldyreva A, 2011, LECT NOTES COMPUT SC, V6841, P578, DOI 10.1007/978-3-642-22792-9_33
[5]  
Boldyreva A, 2009, LECT NOTES COMPUT SC, V5479, P224, DOI 10.1007/978-3-642-01001-9_13
[6]   A personalized recommendation algorithm based on the fusion of trust relation and time series [J].
Chen HongLi .
2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE) AND IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC), VOL 1, 2017, :3-6
[7]  
Chen W., 2023, J. Inf. Secur., V14, P123
[8]   Towards reducing delegation overhead in replication-based verification: An incentive-compatible rational delegation computing scheme [J].
Chen, Zerui ;
Tian, Youliang ;
Xiong, Jinbo ;
Peng, Changgen ;
Ma, Jianfeng .
INFORMATION SCIENCES, 2021, 568 :286-316
[9]  
Cheon J. H., 2019, P INT C SEL AR CRYPT, P227, DOI DOI 10.1007/978-3-COMPUTERSCIENCE,VOL.030-38471-5_10
[10]   Towards a Practical Cluster Analysis over Encrypted Data [J].
Cheon, Jung Hee ;
Kim, Duhyeong ;
Park, Jai Hyun .
SELECTED AREAS IN CRYPTOGRAPHY - SAC 2019, 2020, 11959 :227-249