{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T15:20:57Z","timestamp":1785511257284,"version":"3.56.0"},"reference-count":36,"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":"NSFC Projects","award":["U23A20304"],"award-info":[{"award-number":["U23A20304"]}]},{"name":"NSFC Projects","award":["U25A20428"],"award-info":[{"award-number":["U25A20428"]}]},{"name":"NSFC Projects","award":["62472036"],"award-info":[{"award-number":["62472036"]}]},{"name":"NSFC Projects","award":["62132011"],"award-info":[{"award-number":["62132011"]}]},{"DOI":"10.13039\/501100001809","name":"Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005090","name":"Beijing Nova Program","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005090","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China","award":["JYB2025XDXM114"],"award-info":[{"award-number":["JYB2025XDXM114"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tifs.2026.3683268","type":"journal-article","created":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T19:51:58Z","timestamp":1776369118000},"page":"3944-3959","source":"Crossref","is-referenced-by-count":1,"title":["Byzantine-Robust Asynchronous Federated Learning via Feature Fingerprinting"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1867-0972","authenticated-orcid":false,"given":"Meng","family":"Shen","sequence":"first","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bohan","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3632-3381","authenticated-orcid":false,"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7857-2936","authenticated-orcid":false,"given":"Yue","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Information, Central University of Finance and Economics, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0874-5010","authenticated-orcid":false,"given":"Ming","family":"Li","sequence":"additional","affiliation":[{"name":"College of Cyber Security, Jinan University, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8776-8730","authenticated-orcid":false,"given":"Qi","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-3887","authenticated-orcid":false,"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. AISTATS","author":"McMahan"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3596907"},{"key":"ref3","first-page":"4120","article-title":"Asynchronous stochastic gradient descent with delay compensation","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Zheng"},{"key":"ref4","first-page":"1145","article-title":"Asynchronous Byzantine machine learning (the case of SGD)","volume-title":"Proc. ICML","volume":"80","author":"Damaskinos"},{"key":"ref5","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":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3517395"},{"key":"ref7","first-page":"11751","article-title":"BASGD: Buffered asynchronous SGD for Byzantine learning","volume-title":"Proc. ICML","author":"Yang"},{"key":"ref8","first-page":"840","article-title":"Sageflow: Robust federated learning against both stragglers and adversaries","volume-title":"Proc. NeurIPS","volume":"34","author":"Park"},{"key":"ref9","first-page":"5636","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. ICML","author":"Yin"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3072033"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC49053.2021.9417299"},{"key":"ref12","first-page":"10495","article-title":"Zeno++: Robust fully asynchronous SGD","volume-title":"Proc. ICML","volume":"1","author":"Xie"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3564625.3567991"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00987"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2025.111430"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01549"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2021.24498","article-title":"Manipulating the Byzantine: Optimizing model poisoning attacks and defenses for federated learning","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp.","author":"Shejwalkar"},{"key":"ref18","first-page":"1605","article-title":"Local model poisoning attacks to Byzantine-robust federated learning","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"Fang"},{"key":"ref19","first-page":"8632","article-title":"A little is enough: Circumventing defenses for distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Baruch"},{"key":"ref20","first-page":"634","article-title":"Analyzing federated learning through an adversarial lens","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Bhagoji"},{"key":"ref21","article-title":"BadNets: Identifying vulnerabilities in the machine learning model supply chain","author":"Gu","year":"2017","journal-title":"arXiv:1708.06733"},{"key":"ref22","first-page":"947","article-title":"Data poisoning attacks to local differential privacy protocols","volume-title":"Proc. 30th USENIX Secur. Symp. (USENIX Secur.)","author":"Cao"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19778-9_23"},{"key":"ref24","first-page":"2938","article-title":"How to backdoor federated learning","volume-title":"Proc. AISTATS","volume":"108","author":"Bagdasaryan"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.098"},{"key":"ref26","first-page":"2901","article-title":"On the difficulty of defending contrastive learning against backdoor attacks","volume-title":"Proc. USENIX Secur.","author":"Li"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.74"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020587"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.21105\/joss.00205"},{"key":"ref30","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"Xiao","year":"2017","journal-title":"arXiv:1708.07747"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/srep27988"},{"key":"ref32","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.18653\/v1\/W18-5446","article-title":"GLUE: A multi-task benchmark and analysis platform for natural language understanding","volume-title":"Proc. ICLR","author":"Wang"},{"key":"ref34","first-page":"649","article-title":"Character-level convolutional networks for text classification","volume-title":"Proc. NeurIPS","author":"Zhang"},{"key":"ref35","first-page":"5972","article-title":"No fear of heterogeneity: Classifier calibration for federated learning with non-IID data","volume-title":"Proc. NIPS","author":"Luo"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.37"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11480965.pdf?arnumber=11480965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:21:02Z","timestamp":1776748862000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11480965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/tifs.2026.3683268","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}