Secure Federated Learning Schemes Based on Multi-Key Homomorphic Encryption

Federated learning (FL) has effectively solved the dilemma of "data silos" and has been widely applied into various fields. However, in real-life, user data is often Not Independent and Identically Distributed (Non-IID), and eavesdroppers can still infer users’ private data from various parameters transmitted in FL. Nevertheless, few privacy-preserving FL schemes focus on data heterogeneity, and offline problem causes more accuracy loss under Non-IID. This paper introduces a multi-key homomorphic encryption algorithm to construct two privacy-preserving FL schemes based on FedProx and SCAFFOLD, namely EMKProx and EMKSCAF. The two schemes both incorporate an anti-offline mechanism and take diverse measures to mitigate Non-IID’s impact on convergence speed, where EMKProx inserts a proximal term into loss function which is more suitable for poor hardware condition and EMKSCAF adds control variate to meet higher model performance requirement. We give security analyses to prove their security. In addition, we conduct simulations and comparisons with FL schemes using other privacy protection mechanisms, which show that our schemes behave more efficient and gain higher accuracy than the others.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/trustcom63139.2024.00091
Citations
2
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.69

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Secure Federated Learning Schemes Based on Multi-Key Homomorphic Encryption

Hao Guo, Wenxiu Ding, Mingjun Wang, Zheng Yan
2 citations
Cryptography and Data Security
0.69
article

Secure Federated Learning Schemes Based on Multi-Key Homomorphic Encryption

Hao Guo, Wenxiu Ding, Mingjun Wang, Zheng Yan
article en
2 citations

Abstract

Federated learning (FL) has effectively solved the dilemma of "data silos" and has been widely applied into various fields. However, in real-life, user data is often Not Independent and Identically Distributed (Non-IID), and eavesdroppers can still infer users’ private data from various parameters transmitted in FL. Nevertheless, few privacy-preserving FL schemes focus on data heterogeneity, and offline problem causes more accuracy loss under Non-IID. This paper introduces a multi-key homomorphic encryption algorithm to construct two privacy-preserving FL schemes based on FedProx and SCAFFOLD, namely EMKProx and EMKSCAF. The two schemes both incorporate an anti-offline mechanism and take diverse measures to mitigate Non-IID’s impact on convergence speed, where EMKProx inserts a proximal term into loss function which is more suitable for poor hardware condition and EMKSCAF adds control variate to meet higher model performance requirement. We give security analyses to prove their security. In addition, we conduct simulations and comparisons with FL schemes using other privacy protection mechanisms, which show that our schemes behave more efficient and gain higher accuracy than the others.

Xidian University (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Partnerships for the goals
Openalex Percentile: Top 22%
Cryptography and Data Security
0.69
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.

Secure Federated Learning Schemes Based on Multi-Key Homomorphic Encryption — Hao Guo, Wenxiu Ding, et al. · (2024) | TGRS Research Map | TGRS