FL-SMPC++: A robust framework for privacy-preserving federated learning

Federated Learning (FL) offers a promising paradigm for privacy-preserving collaborative training, yet it remains highly vulnerable to adversarial behaviors, client unreliability, and challenges associated with non-independent and identically distributed (non-IID) data. Existing secure aggregation techniques, while preserving confidentiality, fail to guarantee the integrity and trustworthiness of model updates, leaving FL deployments exposed to poisoning and consistency attacks. This work introduces FL-SMPC++, a robust and privacy-preserving FL framework designed to address these challenges. The primary objective is to develop a scalable solution that ensures verifiable, privacy-preserving aggregation while mitigating malicious client behaviors, dropouts, and data heterogeneity. Our approach integrates Secure Multi-Party Computation (SMPC), Pedersen commitments, and zero-knowledge proofs (ZKPs) to cryptographically bind clients' submitted updates to their validation outcomes without revealing private data. We propose a dynamic client selection strategy based on shared validation performance, a dropout-tolerant threshold aggregation protocol, and a warm-up initialization phase to counteract non-IID distributions. Comprehensive experiments on MNIST, CIFAR-10, FEMNIST, and UCI Heart Disease show that FL-SMPC++ consistently outperforms FedAvg, FedProx, and FedNova. For example, under a label-flipping attack with 30% malicious clients on CIFAR-10 (non-IID), FL-SMPC++ achieves 78.9% accuracy compared to 67.4% for FedAvg, representing an absolute gain of 11.5%. Across datasets, the framework limits accuracy degradation to 6–8% under attack, while baselines suffer 13–20% losses. These results demonstrate that FL-SMPC++ achieves strong cryptographic privacy guarantees together with empirically validated resilience and convergence, offering a scalable and practical blueprint for trustworthy FL in adversarial and resource-constrained environments. • A novel FL framework combines SMPC, commitments, and zero-knowledge proofs. • Ensures submitted model updates match validated ones without revealing them. • Uses dynamic validation for secure and fair client selection. • Tolerates client dropouts using a threshold-based aggregation mechanism. • Outperforms baseline FL methods under adversarial and non-IID conditions.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.