A Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation

The results of federated learning contain certain private information and still have the risk of privacy leakage. Therefore, this paper proposes a Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation (ADDFed). The scheme trains models and generates updates using local datasets at the client side. Based on comparisons between client contributions and two thresholds, it chooses homomorphic encryption, adaptive differential privacy, or data discarding methods to protect the data. The first aggregation model and the second aggregation model are obtained by classification aggregation at the server side. Finally, the client decrypts and aggregates to get the global model. Experimental results demonstrate that ADDFed consumes a privacy budget of 3624.47, involves 562,219,358 bytes of communication, and requires 11,603 seconds of training time, achieving a model accuracy of 87.4%, thus showing significant advantages.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/trustcom63139.2024.00292
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation

Xinyue Yu, Zhiqiang Wang, Ziqing Tian
Privacy-Preserving Technologies in Data
article

A Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation

Xinyue Yu, Zhiqiang Wang, Ziqing Tian
article en

Abstract

The results of federated learning contain certain private information and still have the risk of privacy leakage. Therefore, this paper proposes a Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation (ADDFed). The scheme trains models and generates updates using local datasets at the client side. Based on comparisons between client contributions and two thresholds, it chooses homomorphic encryption, adaptive differential privacy, or data discarding methods to protect the data. The first aggregation model and the second aggregation model are obtained by classification aggregation at the server side. Finally, the client decrypts and aggregates to get the global model. Experimental results demonstrate that ADDFed consumes a privacy budget of 3624.47, involves 562,219,358 bytes of communication, and requires 11,603 seconds of training time, achieving a model accuracy of 87.4%, thus showing significant advantages.

Beijing Electronic Science and Technology Institute (CN)
Beijing Electronic Science and Technology Institute, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 74%
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.

A Federated Learning Scheme with Adaptive Hierarchical Protection and Multiple Aggregation — Xinyue Yu, Zhiqiang Wang, et al. · (2024) | TGRS Research Map | TGRS