{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:19:00Z","timestamp":1778901540439,"version":"3.51.4"},"reference-count":55,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572077"],"award-info":[{"award-number":["62572077"]}],"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":["U25A20429"],"award-info":[{"award-number":["U25A20429"]}],"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":["62332018"],"award-info":[{"award-number":["62332018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Fund of Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation","award":["B202403"],"award-info":[{"award-number":["B202403"]}]},{"name":"Hunan Provincial Social Science Achievement Evaluation Committee","award":["XSP25YBC686"],"award-info":[{"award-number":["XSP25YBC686"]}]}],"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.3656703","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T21:13:22Z","timestamp":1769030002000},"page":"5509-5525","source":"Crossref","is-referenced-by-count":0,"title":["Two-Dimensional Privacy-Preserving Federated Learning Scheme Against Poisoning Attacks"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0793-5218","authenticated-orcid":false,"given":"Ke","family":"Gu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Changsha University of Science and Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1086-5790","authenticated-orcid":false,"given":"Wenwu","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Changsha University of Science and Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0598-7698","authenticated-orcid":false,"given":"Jingjing","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Changsha University of Science and Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6244-2097","authenticated-orcid":false,"given":"Zheng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Changsha University of Science and Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6619-554X","authenticated-orcid":false,"given":"Xiong","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Cyber Security, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0231-3196","authenticated-orcid":false,"given":"WeiJia","family":"Jia","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence and Future Networks, Beijing Normal University, Zhuhai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Federated learning: Strategies for improving communication efficiency","author":"Kone\u010dn\u00fd","year":"2016"},{"key":"ref2","article-title":"Federated optimization: Distributed machine learning for on-device intelligence","author":"Kone\u010dn\u00fd","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134012"},{"key":"ref4","first-page":"16937","article-title":"Inverting gradients- how easy is it to break privacy in federated learning?","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"33","author":"Geiping","year":"2020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2981379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447103"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108609"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2020.3005909"},{"key":"ref10","first-page":"6106","article-title":"Poison frogs! targeted clean-label poisoning attacks on neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shafahi","year":"2018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3023126"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW56347.2022.00383"},{"key":"ref13","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref14","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Blanchard","year":"2017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120350"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2787987"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3196274"},{"key":"ref19","first-page":"7207","article-title":"AegisFL: Efficient and flexible privacy-preserving byzantine-robust cross-silo federated learning","volume-title":"Proc. Forty-First Int. Conf. Mach. Learn.","author":"Chen","year":"2024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3108434"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3523062"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2023.01.026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3112100"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103366"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110178"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3128164"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3212174"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3402113"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3378006"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3541633"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3350206"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3169918"},{"key":"ref35","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","author":"Blanchard","year":"2017"},{"key":"ref36","first-page":"3518","article-title":"The Hidden Vulnerability of Distributed Learning in Byzantium","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"80","author":"Mhamdi","year":"2018"},{"key":"ref37","first-page":"5636","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"80","author":"Yin","year":"2018"},{"key":"ref38","first-page":"1605","article-title":"Local model poisoning attacks to byzantine-robust federated learning","volume-title":"USENIX Secur. Symposium. USENIX Assoc.","author":"Fang","year":"2020"},{"key":"ref39","first-page":"6357","article-title":"Ditto: Fair and robust federated learning through personalization","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"139","author":"Li","year":"2021"},{"key":"ref40","first-page":"261","article-title":"Fall of empires: Breaking byzantine-tolerant SGD by inner product manipulation","volume-title":"UAI","volume":"115","author":"Xie","year":"2019"},{"key":"ref41","article-title":"Density estimation for statistics and data analysis","author":"Silverman","year":"1986","journal-title":"Monographs Statist. Appl. Probability"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9184-y"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3330813"},{"key":"ref45","first-page":"1415","article-title":"FLAME: Taming backdoors in federated learning","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Secur. 22)","author":"Nguyen","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88418-5_23"},{"key":"ref47","article-title":"Mitigating sybils in federated learning poisoning","author":"Fung","year":"2018"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24434"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88418-5_22"},{"key":"ref50","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":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622191"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC51664.2024.10454870"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TICPS.2024.3435178"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3318509"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3420126"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11517592\/11359791.pdf?arnumber=11359791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:05:24Z","timestamp":1778900724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359791\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2026.3656703","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]]}}}