Communication-efficient Verifiable and Oblivious Aggregation with Client Dropouts

Federated learning (FL) allows each client to train data locally and share only model parameters with an aggregation server. A critical component of FL is secure aggregation (SA), which protects user privacy during the server-side aggregation of client model parameters. However, SA-based FL still faces several challenges from a malicious server, affecting both performance and security. To address these issues, we propose the first 2-round-trip verifiable and oblivious aggregation protocol. Specifically, our protocol incorporates: (1) a consistent temporary key disclosure mechanism for round-trip-efficient communication with client dropout resilience; (2) a message authentication code to verify aggregation results; and (3) a multi-round oblivious aggregation scheme that conceals both individual and global model parameters. These three key techniques collectively enable efficient communication while preventing a malicious server from tampering with aggregation results and accessing any individual or global parameters. We conducted a comprehensive evaluation to demonstrate the practicality and efficiency of our design compared to existing schemes.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10887591
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Communication-efficient Verifiable and Oblivious Aggregation with Client Dropouts

Jinsong Han, Zhiguo Wan, Zhangshuang Guan, Yulin Zhao et al.
Cryptography and Data Security
article

Communication-efficient Verifiable and Oblivious Aggregation with Client Dropouts

Jinsong Han, Zhiguo Wan, Zhangshuang Guan, Yulin Zhao, Longyun Yang
article en

Abstract

Federated learning (FL) allows each client to train data locally and share only model parameters with an aggregation server. A critical component of FL is secure aggregation (SA), which protects user privacy during the server-side aggregation of client model parameters. However, SA-based FL still faces several challenges from a malicious server, affecting both performance and security. To address these issues, we propose the first 2-round-trip verifiable and oblivious aggregation protocol. Specifically, our protocol incorporates: (1) a consistent temporary key disclosure mechanism for round-trip-efficient communication with client dropout resilience; (2) a message authentication code to verify aggregation results; and (3) a multi-round oblivious aggregation scheme that conceals both individual and global model parameters. These three key techniques collectively enable efficient communication while preventing a malicious server from tampering with aggregation results and accessing any individual or global parameters. We conducted a comprehensive evaluation to demonstrate the practicality and efficiency of our design compared to existing schemes.

Zhejiang University of Science and Technology (CN), Zhejiang Lab (CN), University of Chinese Academy of Sciences (CN)
National Natural Science Foundation of China
Reduced inequalities
Openalex Percentile: Top 98%
Cryptography and Data Security
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.