{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:02:01Z","timestamp":1780988521998,"version":"3.54.1"},"reference-count":38,"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":"INCIBE and by the European Union NextGeneration EU\/PRTR","award":["HERMES"],"award-info":[{"award-number":["HERMES"]}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["GXXT-2022-049"],"award-info":[{"award-number":["GXXT-2022-049"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202008"],"award-info":[{"award-number":["62202008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23A20308"],"award-info":[{"award-number":["U23A20308"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tifs.2026.3696194","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T19:35:16Z","timestamp":1779478516000},"page":"5440-5454","source":"Crossref","is-referenced-by-count":0,"title":["FairRoP: Robust Client Selection Scheme for Fairness-Aware Federated Learning"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2659-6730","authenticated-orcid":false,"given":"Depeng","family":"Chen","sequence":"first","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Jiang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8714-4626","authenticated-orcid":false,"given":"Rolando","family":"Trujillo-Rasua","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Mathematics, Universitat Rovira i Virgili, Tarragona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0392-9734","authenticated-orcid":false,"given":"Hong","family":"Zhong","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7258-3418","authenticated-orcid":false,"given":"Jie","family":"Cui","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/aaai.12082"},{"key":"ref2","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref3","article-title":"Client selection in federated learning: Convergence analysis and power-of-choice selection strategies","author":"Jee Cho","year":"2020","journal-title":"arXiv:2010.01243"},{"key":"ref4","first-page":"10351","article-title":"Towards understanding biased client selection in federated learning","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist.","volume":"151","author":"Jee Cho"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155494"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3134647"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3263594"},{"key":"ref8","article-title":"Fair resource allocation in federated learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref9","first-page":"6357","article-title":"Ditto: Fair and robust federated learning through personalization","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LNET.2019.2947144"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3079104"},{"key":"ref12","first-page":"4615","article-title":"Agnostic federated learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Mohri"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICME55011.2023.00063"},{"key":"ref14","article-title":"Diverse client selection for federated learning via submodular maximization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Balakrishnan"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3172113"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3040887"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179400"},{"key":"ref18","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Blanchard"},{"key":"ref19","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in Byzantium","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"El Mhamdi"},{"key":"ref20","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3108434"},{"key":"ref22","article-title":"Spectral signatures in backdoor attacks","volume-title":"arXiv:1811.00636","author":"Tran","year":"2018"},{"key":"ref23","article-title":"Can you really backdoor federated learning?","author":"Sun","year":"2019","journal-title":"arXiv:1911.07963"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/106"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35289-8_25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"ref27","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Agrawal"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/9781680834710"},{"key":"ref29","first-page":"2184","article-title":"Two-target algorithms for infinite-armed bandits with Bernoulli rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bonald"},{"key":"ref30","article-title":"Be greedy in multi-armed bandits","author":"Jedor","year":"2021","journal-title":"arXiv:2101.01086"},{"key":"ref31","first-page":"5114","article-title":"Thompson sampling for combinatorial semi-bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref32","first-page":"1","article-title":"Analysis of Thompson sampling for the multi-armed bandit problem","volume-title":"Proc. Conf. Learn. Theory","author":"Agrawal"},{"key":"ref33","first-page":"99","article-title":"Further optimal regret bounds for Thompson sampling","volume-title":"Proc. Artif. Intell. Statist.","author":"Agrawal"},{"key":"ref34","article-title":"Measuring the effects of non-identical data distribution for federated visual classification","author":"Harry Hsu","year":"2019","journal-title":"arXiv:1909.06335"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88418-5_22"},{"key":"ref36","first-page":"1623","article-title":"Local model poisoning attacks to Byzantine-robust federated learning","volume-title":"Proc. 29th USENIX Conf. Secur. Symp.","author":"Fang"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2025.3602647"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3607273"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11534500.pdf?arnumber=11534500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:13:57Z","timestamp":1780985637000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11534500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/tifs.2026.3696194","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}