TAPFed: Threshold Secure Aggregation for Privacy-Preserving Federated Learning
Runhua Xu, Bo Li, Chao Li, James B. D. Joshi, Shuai Ma, Jianxin Li
TL;DR
This paper tackles privacy leaks in federated learning when multiple decentralized aggregators may be malicious. It introduces TAPFed, a threshold secure aggregation framework based on a $t$-of-$n$ threshold multi-client functional encryption (TMCFE) that enables secure aggregation without peer-to-peer aggregator communication or trusted hardware, while preserving model quality. The authors provide a formal security analysis under the Decisional Diffie-Hellman (DDH) assumption and demonstrate, through experiments on MNIST and CIFAR-10, that TAPFed achieves comparable accuracy to baselines while reducing transmission overhead by 29%–45% and defending against gradient inference, disaggregation, and related attacks. They also show TAPFed tolerates limited collusion among aggregators and supports both average and personalized fusion, highlighting practical benefits for cross-silo FL and scalable privacy-preserving deployment.
Abstract
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 paper 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.
