BalancedSecAgg: Toward Fast Secure Aggregation for Federated Learning

被引:0
作者
Masuda, Hiroki [1 ]
Kita, Kentaro [1 ]
Koizumi, Yuki [1 ]
Takemasa, Junji [1 ]
Hasegawa, Toru [2 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Osaka 5650871, Japan
[2] Shimane Univ, Fac Mat Energy, Matsue, Shimane 6908504, Japan
来源
IEEE ACCESS | 2024年 / 12卷
基金
日本学术振兴会;
关键词
Servers; Costs; Protocols; Computational modeling; Privacy; Data models; Vectors; Polynomials; Federated learning; Training data; Data privacy; Dropout tolerance; federated learning; privacy preservation; secure aggregation;
D O I
10.1109/ACCESS.2024.3491779
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning is a promising collaborative learning system from the perspective of training data privacy preservation; however, there is a risk of privacy leakage from individual local models of users. Secure aggregation protocols based on local model masking are a promising solution to prevent privacy leakage. Existing secure aggregation protocols sacrifice either computation or communication costs to tolerate user dropouts. A naive secure aggregation protocol achieves a small communication cost by secretly sharing random seeds instead of random masks. However, it requires that a server incurs a substantial computation cost to reconstruct the random masks from the random seeds of dropout users. To avoid such a reconstruction, a state-of-the-art secure aggregation protocol secretly shares random masks. Although this approach avoids the computation cost of mask reconstruction, it incurs a large communication cost due to secretly sharing random masks. In this paper, we design a secure aggregation protocol to mitigate the tradeoff between the computation cost and the communication cost by complementing both types of secure aggregation protocols. In our experiments, our protocol achieves up to 11.41 times faster while achieving the same level of privacy preservation and dropout tolerance as the existing protocols.
引用
收藏
页码:165265 / 165279
页数:15
相关论文
共 38 条
[1]   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
[2]  
Bellare M, 2000, LECT NOTES COMPUT SC, V1976, P531
[3]   HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].
BLUM, M ;
MICALI, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864
[4]  
Bonawitz K., 2019, Machine Learning and Systems
[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]   Distributed deep learning networks among institutions for medical imaging [J].
Chang, Ken ;
Balachandar, Niranjan ;
Lam, Carson ;
Yi, Darvin ;
Brown, James ;
Beers, Andrew ;
Rosen, Bruce ;
Rubin, Daniel L. ;
Kalpathy-Cramer, Jayashree .
JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2018, 25 (08) :945-954
[7]  
Choi B, 2021, Arxiv, DOI arXiv:2012.05433
[8]  
Cui KP, 2024, Arxiv, DOI arXiv:2402.15111
[9]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[10]   Model Inversion Attacks that Exploit Confidence Information and Basic Countermeasures [J].
Fredrikson, Matt ;
Jha, Somesh ;
Ristenpart, Thomas .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :1322-1333