Toward Efficient Homomorphic Encryption-Based Federated Learning: A Magnitude-Sensitivity Approach

Federated Learning (FL) is a privacy-preserving technique that allows clients to collaboratively train models while keeping their local data private from both other clients and the central server. However, the presence of a malicious server or attacker can lead to model inversion attacks, which compromise clients’ private information. To counteract these threats, homomorphic encryption (HE) has been proposed as a solution, enabling encrypted model aggregation by the server without exposing raw data. This ensures that a malicious server or attacker cannot access model parameters or reveal clients’ local information. However, HE introduces substantial computational and communication overhead, making it impractical for many real-world implementations. To address this, recent research suggests selectively encrypting only a subset of most important model parameters while leaving the rest unencrypted. While it is promising, the challenge lies in identifying these key parameters to maintain security while minimizing the additional costs associated with homomorphic operations. In addition, even with a subset of parameters, none of the existing methods offer truly efficient and practical HE-based solution. In general, these approaches fall short when applied to large, complex deep learning models and are impractical beyond basic implementations. This paper introduces a straightforward yet effective parameter selection and encryption strategy for HE-based federated learning. Our goal is to minimize this computational, and communication overhead caused by homomorphic operations while maintaining robust security, ensuring practical applicability in real-world scenarios. We begin by evaluating different implementations of CKKS (Cheon-Kim-Kim-Song)-based HE algorithm (which allows floating point operations on encrypted domain) across various model architectures, systematically analyzing the additional burden HE imposes in terms of processing time and size of the model parameters. Next, we introduce a magnitude-based selective encryption strategy that not only provide same security guarantees compared to existing methods but is also practical for scaling to larger, more complex models in FL environments. Hence, this approach enables developers to make informed decisions that strike an optimal balance between performance and privacy/security, making it feasible for real-world deployments.

Authors

Institutions

Publication Details

Published
2024-12-15
DOI
https://doi.org/10.1109/bigdata62323.2024.10825533
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Toward Efficient Homomorphic Encryption-Based Federated Learning: A Magnitude-Sensitivity Approach

Ren-Yi Huang, Dumindu Samaraweera, J. Morris Chang
Privacy-Preserving Technologies in Data
article

Toward Efficient Homomorphic Encryption-Based Federated Learning: A Magnitude-Sensitivity Approach

Ren-Yi Huang, Dumindu Samaraweera, J. Morris Chang
article en

Abstract

Federated Learning (FL) is a privacy-preserving technique that allows clients to collaboratively train models while keeping their local data private from both other clients and the central server. However, the presence of a malicious server or attacker can lead to model inversion attacks, which compromise clients’ private information. To counteract these threats, homomorphic encryption (HE) has been proposed as a solution, enabling encrypted model aggregation by the server without exposing raw data. This ensures that a malicious server or attacker cannot access model parameters or reveal clients’ local information. However, HE introduces substantial computational and communication overhead, making it impractical for many real-world implementations. To address this, recent research suggests selectively encrypting only a subset of most important model parameters while leaving the rest unencrypted. While it is promising, the challenge lies in identifying these key parameters to maintain security while minimizing the additional costs associated with homomorphic operations. In addition, even with a subset of parameters, none of the existing methods offer truly efficient and practical HE-based solution. In general, these approaches fall short when applied to large, complex deep learning models and are impractical beyond basic implementations. This paper introduces a straightforward yet effective parameter selection and encryption strategy for HE-based federated learning. Our goal is to minimize this computational, and communication overhead caused by homomorphic operations while maintaining robust security, ensuring practical applicability in real-world scenarios. We begin by evaluating different implementations of CKKS (Cheon-Kim-Kim-Song)-based HE algorithm (which allows floating point operations on encrypted domain) across various model architectures, systematically analyzing the additional burden HE imposes in terms of processing time and size of the model parameters. Next, we introduce a magnitude-based selective encryption strategy that not only provide same security guarantees compared to existing methods but is also practical for scaling to larger, more complex models in FL environments. Hence, this approach enables developers to make informed decisions that strike an optimal balance between performance and privacy/security, making it feasible for real-world deployments.

University of South Florida (US), Embry–Riddle Aeronautical University (US)
Openalex Percentile: Top 76%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.