Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/117617
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorSchool of Accounting and Finance-
dc.creatorCai, Y-
dc.creatorXu, J-
dc.creatorLian, Z-
dc.creatorKei, CWB-
dc.creatorLi, Y-
dc.creatorXu, J-
dc.date.accessioned2026-02-26T03:47:27Z-
dc.date.available2026-02-26T03:47:27Z-
dc.identifier.urihttp://hdl.handle.net/10397/117617-
dc.language.isoenen_US
dc.publisherMDPI AGen_US
dc.rightsCopyright: © 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).en_US
dc.rightsThe following publication Cai, Y., Xu, J., Lian, Z., Brian, K. C. W., Li, Y., & Xu, J. (2025). A Reputation-Aware Defense Framework for Strategic Behaviors in Federated Learning. Telecom, 6(3), 60 is available at https://doi.org/10.3390/telecom6030060.en_US
dc.subjectFederated learningen_US
dc.subjectIncentive mechanismen_US
dc.subjectReputation systemen_US
dc.subjectRobust aggregationen_US
dc.subjectStrategic behavioren_US
dc.subjectTrust managementen_US
dc.titleA reputation-aware defense framework for strategic behaviors in federated learningen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume6-
dc.identifier.issue3-
dc.identifier.doi10.3390/telecom6030060-
dcterms.abstractFederated Learning (FL) enables privacy-preserving model training across distributed clients. However, its reliance on voluntary client participation makes it vulnerable to strategic behaviors—actions that are not overtly malicious but significantly impair model convergence and fairness. Existing defense methods primarily focus on explicit attacks, overlooking the challenges posed by economically motivated “pseudo-honest” clients. To address this gap, we propose a Reputation-Aware Defense Framework to mitigate strategic behaviors in FL. This framework introduces a multi-dimensional dynamic reputation model that evaluates client behaviors based on gradient alignment, participation consistency, and update stability. The resulting reputation scores are incorporated into both aggregation and incentive mechanisms, forming a behavior-feedback loop that rewards honest participation and penalizes opportunistic strategies. We theoretically prove the convergence of reputation scores, the suppression of low-quality updates in aggregation, and the emergence of honest participation as a Nash equilibrium under the incentive mechanism. Experiments on datasets such as CIFAR-10, FEMNIST, MIMIC-III demonstrate that our approach significantly outperforms baseline methods in accuracy, fairness, and robustness, even when up to 60% of clients act strategically. This study bridges trust modeling and robust optimization in FL, offering a secure foundation for federated systems operating in open and incentive-driven environments.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTelecom, Sept 2025, v. 6, no. 3, 60-
dcterms.isPartOfTelecom-
dcterms.issued2025-09-
dc.identifier.scopus2-s2.0-105017424875-
dc.identifier.eissn2673-4001-
dc.identifier.artn60-
dc.description.validate202602 bcch-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis work was supported by the Hainan Provincial Natural Science Foundation of China under Grants 823QN229, 625MS046, and 624QN230, and was partially supported by JSPS KAKENHI Grant Number JP24KF0065.en_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
telecom-06-00060.pdf3.39 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.