{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:11:23Z","timestamp":1768281083097,"version":"3.49.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union (EU) Horizon 2020","award":["101008297"],"award-info":[{"award-number":["101008297"]}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"crossref","award":["EP\/Y036786\/1"],"award-info":[{"award-number":["EP\/Y036786\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Horizon EU","award":["101129910"],"award-info":[{"award-number":["101129910"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3630314","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:45:01Z","timestamp":1766601901000},"page":"2212-2225","source":"Crossref","is-referenced-by-count":0,"title":["Robust and Fair Federated Learning Based on Model-Agnostic Shapley Value"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4136-4735","authenticated-orcid":false,"given":"Rui","family":"Jin","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-8420","authenticated-orcid":false,"given":"Jia","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1395-7314","authenticated-orcid":false,"given":"Geyong","family":"Min","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.5040\/9781782258674.0010"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018","journal-title":"arXiv:1811.03604"},{"key":"ref3","volume-title":"Machine Learning Ledger Orchestration for Drug Discovery (melloddy)","year":"2019"},{"key":"ref4","volume-title":"Utilization of Fate in Risk Management of Credit in Small and Micro Enterprises"},{"key":"ref5","first-page":"261","article-title":"Fall of empires: Breaking Byzantine-tolerant SGD by inner product manipulation","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Xie"},{"key":"ref6","first-page":"2938","article-title":"How to backdoor federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Bagdasaryan"},{"key":"ref7","first-page":"13021","article-title":"A little is enough: Circumventing defenses for distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Baruch"},{"key":"ref8","first-page":"634","article-title":"Analyzing federated learning through an adversarial lens","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Bhagoji"},{"key":"ref9","first-page":"1605","article-title":"Local model poisoning attacks to Byzantine-robust federated learning","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"Fang"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2023.3302016"},{"key":"ref11","first-page":"1846","article-title":"Free-rider attacks on model aggregation in federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Fraboni"},{"key":"ref12","first-page":"1","article-title":"Advanced free-rider attacks in federated learning","volume-title":"Proc. 1st NeurIPS Workshop New Frontiers Federated Learn., Privacy, Fairness, Robustness, Personalization, Data Ownership","author":"Zhu"},{"key":"ref13","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin"},{"key":"ref14","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Blanchard"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3153135"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2023.3293731"},{"key":"ref17","article-title":"Learning to detect malicious clients for robust federated learning","author":"Li","year":"2020","journal-title":"arXiv:2002.00211"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539231"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3324697"},{"key":"ref20","first-page":"301","article-title":"The limitations of federated learning in Sybil settings","volume-title":"Proc. 23rd Int. Symp. Res. Attacks, Intrusions Defenses","author":"Fung"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16849"},{"key":"ref22","first-page":"11372","article-title":"CRFL: Certifiably robust federated learning against backdoor attacks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xie"},{"key":"ref23","article-title":"Free-riders in federated learning: Attacks and defenses","author":"Lin","year":"2019","journal-title":"arXiv:1911.12560"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/8928790"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3288936"},{"key":"ref26","article-title":"A reputation mechanism is all you need: Collaborative fairness and adversarial robustness in federated learning","volume-title":"Proc. Int. Workshop Federated Learn. User Privacy Data Confidentiality Conjunct ICML","author":"Xu"},{"issue":"30","key":"ref27","first-page":"1","article-title":"Attacks against federated learning defense systems and their mitigation","volume":"24","author":"Lewis","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63076-8_11"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006179"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00073"},{"key":"ref31","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","volume":"54","author":"McMahan"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref33","article-title":"Mitigating sybils in federated learning poisoning","author":"Fung","year":"2018","journal-title":"arXiv:1808.04866"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2021.24434","article-title":"FLTrust: Byzantine-robust federated learning via trust bootstrapping","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp.","author":"Cao"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2307\/1912573"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.8.869"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400881970-018"},{"key":"ref38","first-page":"2242","article-title":"Data Shapley: Equitable valuation of data for machine learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","author":"Ghorbani"},{"key":"ref39","first-page":"8780","article-title":"Beta Shapley: A unified and noise-reduced data valuation framework for machine learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kwon"},{"key":"ref40","first-page":"1167","article-title":"Towards efficient data valuation based on the Shapley value","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. (AISTATS)","volume":"89","author":"Jia"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17093"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.04.004"},{"key":"ref43","article-title":"Bounding the estimation error of sampling-based Shapley value approximation","author":"Maleki","year":"2013","journal-title":"arXiv:1306.4265"},{"key":"ref44","first-page":"7184","article-title":"On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization","volume-title":"Proc. 36th Int. Conf. Mach. Learn., (ICML)","author":"Yu"},{"key":"ref45","first-page":"3252","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"97","author":"Karimireddy"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3377655"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00120"},{"key":"ref48","article-title":"LEAF: A benchmark for federated settings","author":"Caldas","year":"2018","journal-title":"arXiv:1812.01097"},{"key":"ref49","article-title":"Privacy-preserving quantification of non-IID degree in federated learning","author":"Yan","year":"2024","journal-title":"arXiv:2406.09682"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11314177.pdf?arnumber=11314177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:59:43Z","timestamp":1768255183000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11314177\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3630314","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}