About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
sis 26(8):

Research Article

An Efficient Privacy-Preserving Secure Aggregation Scheme for Federated Learning with Input Verification and Dropout Resistance

Download7 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/eetsis.11991,
        author={Zijun Guo and Yuteng Sun and Xinyue Zhang and Lingling Wu},
        title={An Efficient Privacy-Preserving Secure Aggregation Scheme for Federated Learning with Input Verification and Dropout Resistance},
        journal={EAI Endorsed Transactions on Scalable Information Systems},
        volume={12},
        number={8},
        publisher={EAI},
        journal_a={SIS},
        year={2026},
        month={3},
        keywords={Secure Aggregation, Privacy Preservation, Secret Sharing, Zero-Knowledge Proofs},
        doi={10.4108/eetsis.11991}
    }
    
  • Zijun Guo
    Yuteng Sun
    Xinyue Zhang
    Lingling Wu
    Year: 2026
    An Efficient Privacy-Preserving Secure Aggregation Scheme for Federated Learning with Input Verification and Dropout Resistance
    SIS
    EAI
    DOI: 10.4108/eetsis.11991
Zijun Guo1,*, Yuteng Sun1,*, Xinyue Zhang1,*, Lingling Wu1,*
  • 1: Chinese People's Armed Police Force Engineering University
*Contact email: g18833211087@163.com, g18833211087@163.com, g18833211087@163.com, g18833211087@163.com

Abstract

Federated learning, as a distributed machine learning paradigm, allows multiple participants to collaboratively train a shared model without sharing their local data. However, the increasing demand for privacy protection during data aggregation within distributed systems underscores the persistent challenge of ensuring both security and efficiency. Many existing Privacy-Preserving Machine Learning (PPML) schemes relying on homomorphic encryption introduce substantial computational overhead during aggregation, rendering them impractical for large-scale PPML applications involving resource-constrained participant devices. Moreover, device dropout events and data poisoning attacks perpetrated by malicious clients adversely affect the integrity of the aggregated results. To address these challenges, this paper proposes an efficient privacy-preserving secure aggregation scheme capable of tolerating participant dropout at arbitrary stages and securing data against both semi-honest and malicious participants. By integrating input verification protocols and applying gradient masking techniques, the scheme enhances its resilience against malicious attacks while ensuring user data privacy. Leveraging the additive homomorphic property of Shamir's secret sharing enables efficient global mask recovery, significantly optimizing the scheme's efficiency. Experimental results demonstrate that the proposed scheme significantly outperforms baseline methods in computational efficiency, communication overhead, and security robustness. By effectively balancing high privacy protection with practical feasibility, this scheme presents a promising solution for secure multi-party aggregation in large-scale distributed systems.

Keywords
Secure Aggregation, Privacy Preservation, Secret Sharing, Zero-Knowledge Proofs
Published
2026-03-16
Publisher
EAI
http://dx.doi.org/10.4108/eetsis.11991

Copyright © 2025 Zijun Guo et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.

EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center
  • Cookie Preferences

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL