Provable Privacy Advantages of Decentralized Federated Learning via Distributed Optimization

被引:0
作者
Yu, Wenrui [1 ]
Li, Qiongxiu [2 ]
Lopuhaa-Zwakenberg, Milan [3 ]
Christensen, Mads Graesboll [2 ]
Heusdens, Richard [4 ,5 ]
机构
[1] CISPA Helmholtz Ctr Informat Secur, D-66123 Saarbrucken, Germany
[2] Aalborg Univ, Dept Elect Syst, DK-9220 Aalborg, Denmark
[3] Univ Twente, Fac Elect Engn Math & Comp Sci, NL-7522 NB Enschede, Netherlands
[4] Netherlands Def Acad, NL-1781 AC Den Helder, Netherlands
[5] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, NL-2628 CD Delft, Netherlands
关键词
Privacy; Peer-to-peer computing; Protocols; Servers; Optimization; Data models; Data privacy; Computational modeling; Topology; Iterative methods; Federated learning; privacy preservation; information theory; distribution optimization; ADMM; PDMM; PRIMAL-DUAL METHOD; CONSENSUS; ADMM; CONVERGENCE; MULTIPLIERS;
D O I
10.1109/TIFS.2024.3516564
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Federated learning (FL) emerged as a paradigm designed to improve data privacy by enabling data to reside at its source, thus embedding privacy as a core consideration in FL architectures, whether centralized or decentralized. Contrasting with recent findings by Pasquini et al., which suggest that decentralized FL does not empirically offer any additional privacy or security benefits over centralized models, our study provides compelling evidence to the contrary. We demonstrate that decentralized FL, when deploying distributed optimization, provides enhanced privacy protection - both theoretically and empirically - compared to centralized approaches. The challenge of quantifying privacy loss through iterative processes has traditionally constrained the theoretical exploration of FL protocols. We overcome this by conducting a pioneering in-depth information-theoretical privacy analysis for both frameworks. Our analysis, considering both eavesdropping and passive adversary models, successfully establishes bounds on privacy leakage. In particular, we show information theoretically that the privacy loss in decentralized FL is upper bounded by the loss in centralized FL. Compared to the centralized case where local gradients of individual participants are directly revealed, a key distinction of optimization-based decentralized FL is that the relevant information includes differences of local gradients over successive iterations and the aggregated sum of different nodes' gradients over the network. This information complicates the adversary's attempt to infer private data. To bridge our theoretical insights with practical applications, we present detailed case studies involving logistic regression and deep neural networks. These examples demonstrate that while privacy leakage remains comparable in simpler models, complex models like deep neural networks exhibit lower privacy risks under decentralized FL. Extensive numerical tests further validate that decentralized FL is more resistant to privacy attacks, aligning with our theoretical findings.
引用
收藏
页码:822 / 838
页数:17
相关论文
共 69 条
[1]  
Alex K., 2009, from Tiny Images
[2]  
[Anonymous], 2016, PROC 23 ACM SIGSAC C
[3]  
[Anonymous], 2012, ELEMENTS INFORM THEO
[4]  
Boenisch F, 2023, Arxiv, DOI arXiv:2112.02918
[5]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[6]   Coded Stochastic ADMM for Decentralized Consensus Optimization With Edge Computing [J].
Chen, Hao ;
Ye, Yu ;
Xiao, Ming ;
Skoglund, Mikael ;
Poor, H. Vincent .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (07) :5360-5373
[7]   Towards Decentralized Deep Learning with Differential Privacy [J].
Cheng, Hsin-Pai ;
Yu, Patrick ;
Hu, Haojing ;
Zawad, Syed ;
Yan, Feng ;
Li, Shiyu ;
Li, Hai ;
Chen, Yiran .
CLOUD COMPUTING - CLOUD 2019, 2019, 11513 :130-145
[8]   Random geometric graphs [J].
Dall, J ;
Christensen, M .
PHYSICAL REVIEW E, 2002, 66 (01)
[9]  
Deng L., 2012, IEEE Signal Processing Magazine, V29, P141
[10]   Gossip Algorithms for Distributed Signal Processing [J].
Dimakis, Alexandros G. ;
Kar, Soummya ;
Moura, Jose M. F. ;
Rabbat, Michael G. ;
Scaglione, Anna .
PROCEEDINGS OF THE IEEE, 2010, 98 (11) :1847-1864