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
- Jinsong Han (ORCID: https://orcid.org/0000-0001-5064-1955)
- Zhiguo Wan (ORCID: https://orcid.org/0000-0003-1319-1224)
- Zhangshuang Guan (ORCID: https://orcid.org/0000-0002-8364-4578)
- Yulin Zhao
- Longyun Yang (ORCID: https://orcid.org/0000-0002-1040-4223)
Institutions
- Zhejiang University of Science and Technology (CN)
- Zhejiang Lab (CN)
- University of Chinese Academy of Sciences (CN)
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
- National Natural Science Foundation of China