arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.01722cs.CRcs.DC
收藏

ACCESS-FL:稳定联邦学习网络中面向高效安全聚合的敏捷通信与计算

ACCESS-FL: Agile Communication and Computation for Efficient Secure Aggregation in Stable Federated Learning Networks

Niousha Nazemi, Omid Tavallaie, Shuaijun Chen, Anna Maria Mandalari, Kanchana Thilakarathna, Ralph Holz, Hamed Haddadi, Albert Y. Zomaya

AI总结:

本文提出ACCESS-FL方法,通过仅在两客户端间生成共享秘密并去除双重掩码和密码学计算,在稳定联邦学习网络中实现恒定计算与通信开销的高效安全聚合,实验证明其显著优于SecAgg和SecAgg+。

摘要:

联邦学习(FL)是一种面向隐私感知应用的有前景的分布式学习框架。FL在客户端设备上训练模型而不共享客户端数据,并通过聚合模型更新在服务器上生成全局模型。传统FL方法在将明文模型更新传输到服务器时存在泄露敏感客户端数据的风险,使其容易受到安全威胁,例如模型逆向攻击,服务器可以通过监测不同轮次中训练模型的变化来推断客户端的原始训练数据。谷歌的安全聚合(SecAgg)协议通过在诚实但好奇和存在客户端掉线的对抗场景中采用双重掩码技术、秘密共享和密码学计算来应对这一威胁。然而,在没有主动对手存在的场景中,SecAgg的计算和通信成本会随着客户端数量的增加而显著上升。为了解决这一问题,本文提出了ACCESS-FL,一种通信和计算高效的安全聚合方法,专为客户端掉线率有限的稳定联邦学习网络中的诚实但好奇场景设计。ACCESS-FL通过仅在两个客户端之间生成共享秘密,并消除对双重掩码、秘密共享和密码学计算的需求,将计算/通信成本降低到恒定水平(与网络规模无关)。为了评估ACCESS-FL的性能,我们使用MNIST、FMNIST和CIFAR数据集进行了实验,以验证所提方法的性能。评估结果表明,与最先进的方法SecAgg和SecAgg+相比,我们提出的方法显著降低了计算和通信开销。

英文摘要:

Federated Learning (FL) is a promising distributed learning framework designed for privacy-aware applications. FL trains models on client devices without sharing the client's data and generates a global model on a server by aggregating model updates. Traditional FL approaches risk exposing sensitive client data when plain model updates are transmitted to the server, making them vulnerable to security threats such as model inversion attacks where the server can infer the client's original training data from monitoring the changes of the trained model in different rounds. Google's Secure Aggregation (SecAgg) protocol addresses this threat by employing a double-masking technique, secret sharing, and cryptography computations in honest-but-curious and adversarial scenarios with client dropouts. However, in scenarios without the presence of an active adversary, the computational and communication cost of SecAgg significantly increases by growing the number of clients. To address this issue, in this paper, we propose ACCESS-FL, a communication-and-computation-efficient secure aggregation method designed for honest-but-curious scenarios in stable FL networks with a limited rate of client dropout. ACCESS-FL reduces the computation/communication cost to a constant level (independent of the network size) by generating shared secrets between only two clients and eliminating the need for double masking, secret sharing, and cryptography computations. To evaluate the performance of ACCESS-FL, we conduct experiments using the MNIST, FMNIST, and CIFAR datasets to verify the performance of our proposed method. The evaluation results demonstrate that our proposed method significantly reduces computation and communication overhead compared to state-of-the-art methods, SecAgg and SecAgg+.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑