计算机科学
数学证明
联合学习
分布式计算
协议(科学)
计算机网络
数据聚合器
遮罩(插图)
建筑
保密
Byzantine容错
计算机安全
信息隐私
服务器
网络体系结构
信息聚合
系统模型
路径(计算)
路由协议
理论计算机科学
密码协议
概念证明
数据完整性
系统体系结构
作者
Lingling Wang,Zhongkai Lu,Meng Li,Jingjing Wang,Keke Gai,Xiaofeng Chen
标识
DOI:10.1109/tifs.2026.3658996
摘要
Secure Aggregation (SA) is a fundamental privacy-preserving technique in Federated Learning (FL) that ensures the confidentiality of local model updates while enabling global model aggregation. Previous studies have implemented SA within the FL architecture that includes a central server. However, in a Device-to-Device (D2D) based FL, decentralized SA becomes challenging due to the lack of a central server, particularly in a zero-trust network vulnerable to Byzantine attacks. To address this issue, we present a novel Byzantine-robust decentralized SA protocol (DeSA) that guarantees the integrity of model training and aggregation while protecting the privacy of model updates. Specifically, we utilize an enhanced zk-SNARK proof system to verify the local model training process. Additionally, we propose a framework that embeds multiple zero-knowledge proofs to ensure the integrity of model aggregation, while maintaining succinct proofs and fast verification. Moreover, we present a Byzantine-robust D2D aggregation protocol that can withstand malicious nodes trying to disrupt model aggregation. To protect privacy, we develop a one-time masking method that eliminates aggregated masks through a dynamic aggregation strategy. This strategy takes into account the adjacency and trust relationships among nodes in evolving network topologies. Finally, we perform a theoretical analysis and evaluate DeSA on real-world datasets. Experimental results show that the time required to verify an embedded proof is significantly reduced compared to the time of verifying multiple proofs. Additionally, its accuracy remains robust against malicious nodes.
科研通智能强力驱动
Strongly Powered by AbleSci AI