Open Access iconOpen Access

ARTICLE

VPAFL: Verifiable Privacy-Preserving Aggregation for Federated Learning Based on Single Server

Peizheng Lai1, Minqing Zhang1,2,*, Yixin Tang1, Ya Yue1, Fuqiang Di1,2

1 College of Cryptography Engineering, Engineering University of PAP, Xi’an, 710086, China
2 Key Laboratory of PAP for Cryptology and Information Security, Xi’an, 710086, China

* Corresponding Author: Minqing Zhang. Email: email

(This article belongs to the Special Issue: Advanced Intelligent Technologies for Networking and Collaborative Systems)

Computers, Materials & Continua 2025, 84(2), 2935-2957. https://doi.org/10.32604/cmc.2025.065887

Abstract

Federated Learning (FL) has emerged as a promising distributed machine learning paradigm that enables multi-party collaborative training while eliminating the need for raw data sharing. However, its reliance on a server introduces critical security vulnerabilities: malicious servers can infer private information from received local model updates or deliberately manipulate aggregation results. Consequently, achieving verifiable aggregation without compromising client privacy remains a critical challenge. To address these problem, we propose a reversible data hiding in encrypted domains (RDHED) scheme, which designs joint secret message embedding and extraction mechanism. This approach enables clients to embed secret messages into ciphertext redundancy spaces generated during model encryption. During the server aggregation process, the embedded messages from all clients fuse within the ciphertext space to form a joint embedding message. Subsequently, clients can decrypt the aggregated results and extract this joint embedding message for verification purposes. Building upon this foundation, we integrate the proposed RDHED scheme with linear homomorphic hash and digital signatures to design a verifiable privacy-preserving aggregation protocol for single-server architectures (VPAFL). Theoretical proofs and experimental analyses show that VPAFL can effectively protect user privacy, achieve lightweight computational and communication overhead of users for verification, and present significant advantages with increasing model dimension.

Keywords

Verifiable federated learning; privacy-preserving; homomorphic encryption; reversible data hiding in encrypted domain; secret sharing

Cite This Article

APA Style
Lai, P., Zhang, M., Tang, Y., Yue, Y., Di, F. (2025). VPAFL: Verifiable Privacy-Preserving Aggregation for Federated Learning Based on Single Server. Computers, Materials & Continua, 84(2), 2935–2957. https://doi.org/10.32604/cmc.2025.065887
Vancouver Style
Lai P, Zhang M, Tang Y, Yue Y, Di F. VPAFL: Verifiable Privacy-Preserving Aggregation for Federated Learning Based on Single Server. Comput Mater Contin. 2025;84(2):2935–2957. https://doi.org/10.32604/cmc.2025.065887
IEEE Style
P. Lai, M. Zhang, Y. Tang, Y. Yue, and F. Di, “VPAFL: Verifiable Privacy-Preserving Aggregation for Federated Learning Based on Single Server,” Comput. Mater. Contin., vol. 84, no. 2, pp. 2935–2957, 2025. https://doi.org/10.32604/cmc.2025.065887



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 347

    View

  • 135

    Download

  • 0

    Like

Share Link