Skip to content

CVFL-Pro: A Collusion-Resistant Verification Federated Learning Framework With Adaptive Communication Optimization

2026 · IEEE Transactions on Information Forensics and Security · Vol 21, pp. 6804-6817 · 0 citations · 27 references
Computer Science

Abstract

Federated learning has gained significant attention for its ability to train models without directly accessing raw data. However, the malicious server may falsify the aggregation results to save computational resources. While existing verifiable federated learning methods can validate the results, they exacerbate communication bottlenecks and fail to achieve collusion-resistant verification in the absence of a trusted authority. In this paper, we propose CVFL-Pro, a collusion-resistant verification federated learning framework with adaptive communication optimization. Specifically, we utilize a mask and Shamir’s secret sharing for privacy protection, and it is robust against client dropout. We combine a lightweight MAC scheme and auxiliary nodes to achieve efficient verifiability. Furthermore, we design an adaptive communication optimization algorithm (AOTop-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>), which dynamically adjusts the compression rate <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> based on the gradient magnitude and the gradient variation between rounds, ensuring optimal performance with minimal cost. Finally, we instantiate CVFL-Pro and prove its correctness and security against collusion by up to <inline-formula> <tex-math notation="LaTeX">$|N|-2$ </tex-math></inline-formula> clients (where <inline-formula> <tex-math notation="LaTeX">$|N|$ </tex-math></inline-formula> is the total number of clients) and the server. Extensive evaluations on MNIST, CIFAR-10, and CIFAR-100 datasets demonstrate that CVFL-Pro reduces communication overhead by 58.07% compared to the optimal Top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> and 95.81% compared to SecAgg. Experiments show that CVFL-Pro reduces communication overhead by up to 95.81% while maintaining accuracy. It dynamically adjusts compression and achieves efficient storage, requiring only 830.16KB compared to 1952.62KB in SecAgg.

View source

Similar papers

#federated learning Open access Sep 2026

VCFedAdam: A Verifiable and Compressed FedAdam Aggregation Scheme for Federated Learning in Distributed Sensor Networks

Experimental results show that VCFedAdam reduces computation overhead by 90.25% and communication overhead by 75.38% compared with traditional secure aggregation, and security analysis confirms that VCFedAdam achieves both privacy protection and aggregation verifiability.

Zhi-Wei Si, Xiu-Heng Liao, Ziang Wu et al. · 0 citations
Preprint Aug 2026

BackDFL: A Unified Benchmark For Backdoor Attacks and Defenses In Decentralized Federated Learning

BackDFL is presented, a unified benchmark for systematically evaluating DFL under realistic and adaptive backdoor attacks, and demonstrates that both state-of-the-art Byzantine-robust DFL methods and adapted FL backdoor defenses fail under modest malicious participation rates, especially in heterogeneous settings.

M. Bouchiha, Gregory Blanc, Yu-Fei Han · 0 citations

PNFR: practicality-enhanced and non-interactive privacy-preserving federated regressions

PNFR is designed, a privacy-preserving federated learning scheme for regressions training built on the MPaillier algorithm, which is three times faster than interactive federated regressions PrivFL and about 80% faster than non-interactive federated regressions VANE.

Hui-Yu Xie, Tanping Zhou, Shuo Chen et al. · 0 citations

Information-Theoretically Secure Aggregation for Lightweight Federated Learning: Resilient to Dropouts and Adversaries

This work proposes a lightweight and information-theoretically secure aggregation framework that securely computes the majority vote (MV) polynomial through single-round secure multiplication, ensuring end-to-end information-theoretic security under the honest-majority assumption while revealing only the final aggregat...

Hyeong-Gun Joo, Songnam Hong, Dong-Joon Shin · 0 citations
Preprint Jul 2026

Information-Theoretically Secure Aggregation for Lightweight Federated Learning: Resilient to Dropouts and Adversaries

This work proposes a lightweight and information-theoretically secure aggregation framework that securely computes the majority vote (MV) polynomial through single-round secure multiplication, ensuring end-to-end information-theoretic security under the honest-majority assumption while revealing only the final aggregat...

Hyeong-Gun Joo, Songnam Hong, Dong-Joon Shin · 0 citations
Conference Aug 2026

URP-FL: Robust and Personalized Federated Learning under Heterogeneous and Adversarial Conditions

Federated learning is appealing for privacy-sensitive network systems, yet its practical deployment remains hindered by the following three recurring challenges: (1) client drift under non-IID data, (2) vulnerability to corrupted updates, and (3) the communication cost of repeated model exchange. Most existing approach...

Hua Kun, Wei Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.