Secure and efficient federated learning via novel multi-party computation and compressed sensing

被引:17
作者
Chen, Lvjun [1 ]
Xiao, Di [1 ]
Yu, Zhuyang [1 ]
Zhang, Maolan [1 ]
机构
[1] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Federated learning; Compressed sensing; Secure multi-party computation; Functional encryption; Internet of things;
D O I
10.1016/j.ins.2024.120481
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning (FL) enables the full utilization of decentralized training without raw data. However, various attacks still threaten the training process of FL. To address these concerns, differential privacy (DP) and secure multi -party computation (SMC) are applied, but these methods may result in low accuracy and heavy training load. Moreover, the high communication consumption of FL in resource -constrained devices is also a challenging problem. In this paper, we propose a novel SMC algorithm for the FL (FL-IPFE) to protect the local gradients. It does not require a trusted third party (TTP) and is more suitable for FL. Furthermore, we propose a secure and efficient FL algorithm (SEFL), which applies compressed sensing (CS) and allor -nothing transform (AONT) to minimize the number of transmitted and encrypted model updates. Additionally, our FL-IPFE is used to encrypt the last element of the preprocessed parameters for guaranteeing the security of the entire local model updates. Meanwhile, the issue of participant dropouts is also taken into account. Theoretical analyses demonstrate that our proposed algorithms can aggregate model updates with high security. Finally, experimental evaluation reveals that our SEFL possesses higher efficiency compared to other state-of-the-art works, while providing comparable model accuracy and strong privacy guarantees.
引用
收藏
页数:17
相关论文
共 37 条
[1]   Scalable and Secure Logistic Regression via Homomorphic Encryption [J].
Aono, Yoshinori ;
Hayashi, Takuya ;
Le Trieu Phong ;
Wang, Lihua .
CODASPY'16: PROCEEDINGS OF THE SIXTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY, 2016, :142-144
[2]  
Bernstein J, 2018, PR MACH LEARN RES, V80
[3]   Analysis of One-Time Random Projections for Privacy Preserving Compressed Sensing [J].
Bianchi, Tiziano ;
Bioglio, Valerio ;
Magli, Enrico .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (02) :313-327
[4]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[5]   Practical Secure Aggregation for Privacy-Preserving Machine Learning [J].
Bonawitz, Keith ;
Ivanov, Vladimir ;
Kreuter, Ben ;
Marcedone, Antonio ;
McMahan, H. Brendan ;
Patel, Sarvar ;
Ramage, Daniel ;
Segal, Aaron ;
Seth, Karn .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1175-1191
[6]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6597, P253, DOI 10.1007/978-3-642-19571-6_16
[7]  
Chaudhari H, 2021, Arxiv, DOI arXiv:1912.02631
[8]  
Chen B., 2022, IEEE Trans. Big Data
[9]   Low-Complexity Compressed-Sensing-Based Watermark Cryptosystem and Circuits Implementation for Wireless Sensor Networks [J].
Chen, Ting-Sheng ;
Hou, Kai-Ni ;
Beh, Win-Ken ;
Wu, An-Yeu .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2019, 27 (11) :2485-2497
[10]  
Chotard J, 2018, LECT NOTES COMPUT SC, V11273, P703, DOI 10.1007/978-3-030-03329-3_24