{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:11:02Z","timestamp":1773677462326,"version":"3.50.1"},"reference-count":0,"publisher":"European Alliance for Innovation n.o.","issue":"8","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICST Transactions on Scalable Information Systems"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.4108\/eetsis.11991","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:39:21Z","timestamp":1773671961000},"source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Privacy-Preserving Secure Aggregation Scheme for Federated Learning with Input Verification and Dropout Resistance"],"prefix":"10.4108","volume":"12","author":[{"given":"Zijun","family":"Guo","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/031jzbb03","id-type":"ROR","asserted-by":"publisher"}],"name":"Chinese People's Armed Police Force Engineering University"}]},{"given":"Yuteng","family":"Sun","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/031jzbb03","id-type":"ROR","asserted-by":"publisher"}],"name":"Chinese People's Armed Police Force Engineering University"}]},{"given":"Xinyue","family":"Zhang","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/031jzbb03","id-type":"ROR","asserted-by":"publisher"}],"name":"Chinese People's Armed Police Force Engineering University"}]},{"given":"Lingling","family":"Wu","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/031jzbb03","id-type":"ROR","asserted-by":"publisher"}],"name":"Chinese People's Armed Police Force Engineering University"}]}],"member":"2587","published-online":{"date-parts":[[2026,3,16]]},"container-title":["ICST Transactions on Scalable Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/publications.eai.eu\/index.php\/sis\/article\/download\/11991\/3975","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/publications.eai.eu\/index.php\/sis\/article\/download\/11991\/3975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:39:21Z","timestamp":1773671961000},"score":1,"resource":{"primary":{"URL":"https:\/\/publications.eai.eu\/index.php\/sis\/article\/view\/11991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":0,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,3,16]]}},"URL":"https:\/\/doi.org\/10.4108\/eetsis.11991","relation":{},"ISSN":["2032-9407"],"issn-type":[{"value":"2032-9407","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]}}}