Paper 2026/416

An Ultra-Robust Privacy Preserving Scheme for Federated Learning using Distributed Homomorphic Encryption

Ikhlas Mastour, Conservatoire National des Arts et Metiers, 292 Rue Saint-Martin, 75003, Paris, France, Higher Institute of Computer Science and Communication Technologies, University of Sousse, GP1, 4011, Sousse, Tunisia, Efrei Paris Pantheon Assas University, 30-32 Av. de la R´epublique, Villejuif, 94800, Paris, France
Layth Sliman, Efrei Paris Pantheon Assas University, 30-32 Av. de la R´epublique, Villejuif, 94800, Paris, France
Boussad Ait Salem, Efrei Paris Pantheon Assas University, 30-32 Av. de la R´epublique, Villejuif, 94800, Paris, France
Balthazar Bauer, University of Versailles, Saint-Quentin-en-Yvelines, 78000, Versailles, France.
Raoudha Ben Djemaa, Higher Institute of Computer Science and Communication Technologies, University of Sousse, GP1, 4011, Sousse, Tunisia
Kamel Barkaoui, Conservatoire National des Arts et Metiers, 292 Rue Saint-Martin, 75003, Paris, France
Abstract

Federated Learning is an emerging machine learning paradigm that enables distributed model training directly at data sources and transmitting only model updates, thereby reducing communication bottlenecks and mitigating risks associated with raw data exposure. Despite these advantages, recent advances have demonstrated that privacy in federated learning remains limited and subject to inference attacks that exploit shared model updates to extract sensitive information. To address this limitation, we propose Robust and Resilient Federated Learning using Distributed Homomorphic Encryption (RRFL-DHE), a privacy-preserving federated learning framework that combines a distributed homomorphic encryption scheme with threshold linear secret sharing. The framework enables clients to encrypt their model updates to allow secure aggregation without exposing individual contributions. To maintain resilience against client dropouts, RRFL-DHE incorporates a dropout management protocol, maintaining training continuity and accurate global model reconstruction. To assess our framework, we provide a rigorous security proof against a semi-honest server model and evaluate RRFL-DHE on non-IID MNIST and Fashion MNIST datasets using SVM and CNN models. The results show that RRFL-DHE preserves model utility with less than 1% deviation compared to the FedAvg approach, while outperforming the xMK-CKKS approach by approximately 15% in accuracy. These findings highlight the importance of RRFL-DHE as a promising solution for distributed computing, while preserving privacy, maintaining utility, and ensuring resilience against dropouts.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Homomorphic EncryptionSecret SharingPrivacy-Preserving Machine LearningFederated LearningDropout-Resilience
Contact author(s)
ikhlas mastour @ efrei fr
layth sliman @ efrei fr
bousad ait salem @ efrei fr
balthazar bauer @ ens fr
raoudha benjemaa @ isitc u-sousse tn
kamel barkaoui @ cnam fr
History
2026-03-03: approved
2026-03-02: received
See all versions
Short URL
https://ia.cr/2026/416
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/416,
      author = {Ikhlas Mastour and Layth Sliman and Boussad Ait Salem and Balthazar Bauer and Raoudha Ben Djemaa and Kamel Barkaoui},
      title = {An Ultra-Robust Privacy Preserving Scheme for Federated Learning using Distributed Homomorphic Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/416},
      year = {2026},
      url = {https://eprint.iacr.org/2026/416}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.