{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T15:03:56Z","timestamp":1779203036819,"version":"3.51.4"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3592207","type":"journal-article","created":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T17:56:37Z","timestamp":1753379797000},"page":"153866-153885","source":"Crossref","is-referenced-by-count":3,"title":["FedChallenger: A Robust Challenge-Response and Aggregation Strategy to Defend Poisoning Attacks in Federated Learning"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5429-7403","authenticated-orcid":false,"given":"M. A.","family":"Moyeen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4597-1700","authenticated-orcid":false,"given":"Kuljeet","family":"Kaur","sequence":"additional","affiliation":[{"name":"École de Technologie Supérieure (ÉTS), University of Quebec in Montreal, Montreal, QC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3639-3304","authenticated-orcid":false,"given":"Anjali","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Ricardo","family":"Manzano","sequence":"additional","affiliation":[{"name":"Cistech Ltd., Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0610-0470","authenticated-orcid":false,"given":"Marzia","family":"Zaman","sequence":"additional","affiliation":[{"name":"Cistel Technology Inc., Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nishith","family":"Goel","sequence":"additional","affiliation":[{"name":"Cistech Ltd., Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"18","article-title":"Demystifying decentralized storage\u2014A critical building block of future of Internet or Web 3.0","volume":"17","author":"Sarkar","year":"2024","journal-title":"Telecom Bus. Rev."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3061697"},{"key":"ref3","article-title":"Privacy-preserving machine learning: Methods, challenges and directions","author":"Xu","year":"2021","journal-title":"arXiv:2108.04417"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3238823"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2024.3386932"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103270"},{"key":"ref7","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref8","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":"ref9","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin"},{"key":"ref10","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-38991-8_39"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00086"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2024.3376651"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3605098.3635896"},{"key":"ref15","article-title":"Defending against the label-flipping attack in federated learning","author":"Moharram Jebreel","year":"2022","journal-title":"arXiv:2207.01982"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3636534.3698247"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10437878"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3347170"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/0470013192.bsa384"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/iccc57788.2023.10233464"},{"key":"ref21","article-title":"The hidden vulnerability of distributed learning in Byzantium","author":"Mahdi El Mhamdi","year":"2018","journal-title":"arXiv:1802.07927"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/670"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3108434"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5188-5"},{"key":"ref25","article-title":"Spectral signatures in backdoor attacks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tran"},{"key":"ref26","first-page":"1299","article-title":"When does machine learning FAIL? Generalized transferability for evasion and poisoning attacks","volume-title":"Proc. 27th USENIX Secur. Symp. USENIX Secur.)","author":"Suciu"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00057"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.02.037"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2765202"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00075"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10001718"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.098"},{"key":"ref33","article-title":"FAT: Federated adversarial training","author":"Zizzo","year":"2020","journal-title":"arXiv:2012.01791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3237554"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3517395"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3236008"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3570119"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3552168"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2988796"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3555193"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3556906"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2025.3540420"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3542437"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3611966"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3323206"},{"key":"ref47","first-page":"17202","article-title":"Sharper convergence guarantees for asynchronous SGD for distributed and federated learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Koloskova"},{"key":"ref48","article-title":"Learning differentially private recurrent language models","author":"Brendan McMahan","year":"2017","journal-title":"arXiv:1710.06963"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.02.025"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3169902"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11095660.pdf?arnumber=11095660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T05:57:32Z","timestamp":1757483852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11095660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3592207","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}