{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T15:03:55Z","timestamp":1779203035651,"version":"3.51.4"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22A2099"],"award-info":[{"award-number":["U22A2099"]}],"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":["62336003"],"award-info":[{"award-number":["62336003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tdsc.2026.3657365","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:02:01Z","timestamp":1769202121000},"page":"5655-5671","source":"Crossref","is-referenced-by-count":2,"title":["DMPA: Durable Model Poisoning Attack Against Fairness and Robustness in Efficient Federated Learning Systems"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0946-183X","authenticated-orcid":false,"given":"Jionghui","family":"Jiang","sequence":"first","affiliation":[{"name":"Engineering Research Center of Trustworthy AI (Ministry of Education), Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5951-3789","authenticated-orcid":false,"given":"Fengrui","family":"Hao","sequence":"additional","affiliation":[{"name":"Engineering Research Center of Trustworthy AI (Ministry of Education), Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1593-1292","authenticated-orcid":false,"given":"Tianlong","family":"Gu","sequence":"additional","affiliation":[{"name":"Engineering Research Center of Trustworthy AI (Ministry of Education), Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2460-7758","authenticated-orcid":false,"given":"Ke","family":"Wang","sequence":"additional","affiliation":[{"name":"Engineering Research Center of Trustworthy AI (Ministry of Education), Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-9732","authenticated-orcid":false,"given":"Xiaoli","family":"Liu","sequence":"additional","affiliation":[{"name":"Engineering Research Center of Trustworthy AI (Ministry of Education), Jinan University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangbin","family":"Wen","sequence":"additional","affiliation":[{"name":"Guangzhou Research Institute of Information Technology, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","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","year":"2017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3567301"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3574745"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3138394"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2996273"},{"key":"ref6","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3349614.3356026"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567485"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3629559"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3650081"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3354736"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2021.3135422"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3353317"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3274119"},{"key":"ref15","first-page":"2938","article-title":"How to backdoor federated learning","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","author":"Bagdasaryan","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3376790"},{"key":"ref17","first-page":"1605","article-title":"Local model poisoning attacks to byzantine-robust federated learning","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"Fang","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24498"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833647"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/508"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17080"},{"key":"ref22","first-page":"16070","article-title":"Attack of the tails: Yes, you really can backdoor federated learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Wang","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322475"},{"key":"ref24","article-title":"Thinking two moves ahead: Anticipating other users improves backdoor attacks in federated learning","author":"Wen","year":"2022"},{"key":"ref25","first-page":"26429","article-title":"Neurotoxin: Durable backdoors in federated learning","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Zhang","year":"2022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.2000295"},{"key":"ref27","first-page":"6855","article-title":"HeteroFL: Computation and communication efficient federated learning for heterogeneous clients","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Diao","year":"2021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01566"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3166101"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/67"},{"key":"ref31","first-page":"2021","article-title":"FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization","volume-title":"Proc. 23rd Int. Conf. Artif. Intell. Statist.","volume":"108","author":"Reisizadeh","year":"2020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3581728"},{"key":"ref33","first-page":"1231","article-title":"Fair resource allocation in federated learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2020"},{"key":"ref34","first-page":"4615","article-title":"Agnostic federated learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Mohri","year":"2019"},{"key":"ref35","first-page":"26091","article-title":"Addressing algorithmic disparity and performance inconsistency in federated learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Cui","year":"2021"},{"key":"ref36","first-page":"6357","article-title":"Ditto: Fair and robust federated learning through personalization","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Li","year":"2021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2209"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW53098.2021.00263"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/223"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26122"},{"key":"ref41","first-page":"6284","article-title":"An equivalence between data poisoning and byzantine gradient attacks","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Farhadkhani","year":"2022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3128646"},{"key":"ref43","first-page":"6712","article-title":"Chameleon: Adapting to peer images for planting durable backdoors in federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai","year":"2023"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3345171"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3594175"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3604514"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2025.3525554"},{"key":"ref48","first-page":"19249","article-title":"Adversarial attacks on fairness of graph neural networks","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Zhang","year":"2024"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67658-2_10"},{"key":"ref50","article-title":"On adversarial bias and the robustness of fair machine learning","author":"Chang","year":"2020"},{"key":"ref51","first-page":"6818","article-title":"Robust fair clustering: A novel fairness attack and defense framework","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Chhabra","year":"2023"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00117"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3563668"},{"key":"ref54","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in byzantium","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Mhamdi","year":"2018"},{"key":"ref55","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Blanchard","year":"2017"},{"key":"ref56","first-page":"1620","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Karimireddy","year":"2022"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3079472"},{"key":"ref58","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120475"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/106"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3205714"},{"issue":"1","key":"ref62","first-page":"1","article-title":"Advances and open problems in federated learning","volume":"14","author":"P","year":"2021","journal-title":"Foundations Trends Mach. Learn."},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref64","article-title":"Federated unlearning: How to efficiently erase a client in FL?","author":"Halimi","year":"2022"},{"key":"ref65","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Sutskever","year":"2013"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"ref67","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2020"},{"key":"ref68","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref69","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"Xiao","year":"2017"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref71","article-title":"Can you really backdoor federated learning?","volume-title":"Proc. 2nd Int. Workshop Federated Learn. Data Privacy Confidentiality","author":"Sun","year":"2019"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11517592\/11362944.pdf?arnumber=11362944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:05:55Z","timestamp":1778900755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11362944\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":71,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2026.3657365","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}