TAPFed: Threshold Secure Aggregation for Privacy-Preserving Federated Learning

被引:3
作者
Xu, Runhua [1 ]
Li, Bo [1 ,2 ]
Li, Chao [3 ]
Joshi, James B. D. [4 ]
Ma, Shuai [1 ]
Li, Jianxin [1 ,2 ]
机构
[1] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
[2] Zhongguancun Lab, Beijing 100086, Peoples R China
[3] Beijing Jiaotong Univ, Beijing Key Lab Secur & Privacy Intelligent Transp, Beijing 100044, Peoples R China
[4] Univ Pittsburgh, Pittsburgh, PA 15260 USA
基金
中国国家自然科学基金;
关键词
Computational modeling; Federated learning; Privacy; Data models; Training; Cryptography; Peer-to-peer computing; Threshold secure aggregation; threshold functional encryption; privacy-preserving federated learning; ATTACKS;
D O I
10.1109/TDSC.2024.3350206
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning is a computing paradigm that enhances privacy by enabling multiple parties to collaboratively train a machine learning model without revealing personal data. However, current research indicates that traditional federated learning platforms are unable to ensure privacy due to privacy leaks caused by the interchange of gradients. To achieve privacy-preserving federated learning, integrating secure aggregation mechanisms is essential. Unfortunately, existing solutions are vulnerable to recently demonstrated inference attacks such as the disaggregation attack. This article proposes TAPFed, an approach for achieving privacy-preserving federated learning in the context of multiple decentralized aggregators with malicious actors. TAPFed uses a proposed threshold functional encryption scheme and allows for a certain number of malicious aggregators while maintaining security and privacy. We provide formal security and privacy analyses of TAPFed and compare it to various baselines through experimental evaluation. Our results show that TAPFed offers equivalent performance in terms of model quality compared to state-of-the-art approaches while reducing transmission overhead by 29%-45% across different model training scenarios. Most importantly, TAPFed can defend against recently demonstrated inference attacks caused by curious aggregators, which the majority of existing approaches are susceptible to.
引用
收藏
页码:4309 / 4323
页数:15
相关论文
共 49 条
[1]   From Single-Input to Multi-client Inner-Product Functional Encryption [J].
Abdalla, Michel ;
Benhamouda, Fabrice ;
Gay, Romain .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT III, 2019, 11923 :552-582
[2]   Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings [J].
Abdalla, Michel ;
Catalano, Dario ;
Fiore, Dario ;
Gay, Romain ;
Ursu, Bogdan .
ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 :597-627
[3]  
Asoodeh S., 2020, P INT WORKSH FED LEA, P132
[4]  
Baracaldo Nathalie, 2022, Federated Learning, P281
[5]  
Bell J, 2023, PROCEEDINGS OF THE 32ND USENIX SECURITY SYMPOSIUM, P4805
[6]   Secure Single-Server Aggregation with (Poly)Logarithmic Overhead [J].
Bell, James Henry ;
Bonawitz, Kallista A. ;
Gascon, Adria ;
Lepoint, Tancrede ;
Raykova, Mariana .
CCS '20: PROCEEDINGS OF THE 2020 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2020, :1253-1269
[7]   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
[8]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6597, P253, DOI 10.1007/978-3-642-19571-6_16
[9]  
Carlini N, 2019, PROCEEDINGS OF THE 28TH USENIX SECURITY SYMPOSIUM, P267
[10]  
Chaum D., 1988, Journal of Cryptology, V1, P65, DOI 10.1007/BF00206326