AI Insight
This paper proposes a federated learning framework that combines two complementary techniques: a threshold-adaptive channel pruning mechanism that dynamically calibrates compression rates based on accuracy feedback, and a multi-key BGV (Brakerski-Gentry-Vaikuntanathan) fully homomorphic encryption protocol that allows a central server to aggregate model parameters without decrypting them. The adaptive pruning reduces the volume of parameters transmitted per communication round, while the multi-key encryption architecture provides provable resistance against collusion attacks involving up to C−1 out of C total participating devices. Experiments conducted on the MNIST and CIFAR-10 benchmark datasets validate the scheme's ability to reduce communication overhead while preserving model accuracy and data privacy.
Why it matters
This approach addresses two critical bottlenecks in real-world federated learning deployments — communication inefficiency and vulnerability to collusion attacks — making it particularly relevant for privacy-sensitive applications in healthcare, finance, and IoT environments with resource-constrained edge devices.
Understand the Science
by Jie Guo, Renjing Liu, Jinsheng Xing
Under the federated learning framework, frequent parameter interactions between edge devices and servers result in communication inefficiency, while conventional encryption methods fail to resist multi-node collusion attacks. To address these challenges, this paper proposes an optimized federated learning scheme integrating adaptive channel pruning with multi-key homomorphic encryption. First, we construct a dynamic threshold determination mechanism that automatically calibrates channel pruning rates through precision feedback during the pre-pruning phase, achieving the optimal balance between model compression and accuracy, while significantly reducing communication bandwidth consumption compared to traditional algorithms. Second, based on the Brakerski-Gentry-Vaikuntanathan (BGV) multi-key fully homomorphic encryption architecture, we design a distributed public-key encryption protocol that enables aggregation servers to securely fuse multi-source model parameters without decryption, resisting collusion attacks from up to C − 1 nodes (where C denotes the total number of devices). Experiments on MNIST and CIFAR-10 datasets demonstrate that our scheme significantly reduces communication overhead through two complementary mechanisms: adaptive pruning reduces both the computational burden of local training and the volume of parameters transmitted per round, while multi-key BGV encryption ensures privacy-preserving aggregation without decryption. This work provides a novel technical pathway for privacy-preserving federated learning in resource-constrained scenarios.