{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T03:10:11Z","timestamp":1746241811216,"version":"3.40.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T00:00:00Z","timestamp":1746230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11704-025-40924-1","type":"journal-article","created":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T02:34:10Z","timestamp":1746239650000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing poisoning attack mitigation in federated learning through perturbation-defense complementarity on history gradients"],"prefix":"10.1007","volume":"19","author":[{"given":"Cong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhilong","family":"Mi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqiao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binghui","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,3]]},"reference":[{"key":"40924_CR1","first-page":"1273","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics","author":"B McMahan","year":"2017","unstructured":"McMahan B, Moore E, Ramage D, Hampson S, Arcas B A Y. Communication-efficient learning of deep networks from decentralized data. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. 2017, 1273\u20131282"},{"issue":"1","key":"40924_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/JIOT.2021.3079916","volume":"9","author":"C Xenofontos","year":"2022","unstructured":"Xenofontos C, Zografopoulos I, Konstantinou C, Jolfaei A, Khan M K, Choo K K R. Consumer, commercial, and industrial IoT (in) security: attack taxonomy and case studies. IEEE Internet of Things Journal, 2022, 9(1): 199\u2013221","journal-title":"IEEE Internet of Things Journal"},{"key":"40924_CR3","first-page":"118","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"P Blanchard","year":"2017","unstructured":"Blanchard P, El Mhamdi E M, Guerraoui R, Stainer J. Machine learning with adversaries: byzantine tolerant gradient descent. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. 2017, 118\u2013128"},{"key":"40924_CR4","first-page":"4824","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","author":"Q Xia","year":"2019","unstructured":"Xia Q, Tao Z, Hao Z, Li Q. FABA: an algorithm for fast aggregation against byzantine attacks in distributed neural networks. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019, 4824\u20134830"},{"key":"40924_CR5","first-page":"6893","volume-title":"Proceedings of the 36th International Conference on Machine Learning","author":"C Xie","year":"2019","unstructured":"Xie C, Koyejo S, Gupta I. Zeno: Distributed stochastic gradient descent with suspicion-based fault-tolerance. In: Proceedings of the 36th International Conference on Machine Learning. 2019, 6893\u20136901"},{"key":"40924_CR6","first-page":"775","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems","author":"G Baruch","year":"2019","unstructured":"Baruch G, Baruch M, Goldberg Y. A little is enough: circumventing defenses for distributed learning. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems. 2019, 775"},{"key":"40924_CR7","first-page":"5650","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"D Yin","year":"2018","unstructured":"Yin D, Chen Y, Kannan R, Bartlett P. Byzantine-robust distributed learning: towards optimal statistical rates. In: Proceedings of the 35th International Conference on Machine Learning. 2018, 5650\u20135659"},{"key":"40924_CR8","first-page":"21404","volume-title":"Proceedings of the 40th International Conference on Machine Learning","author":"Y Liu","year":"2023","unstructured":"Liu Y, Chen C, Lyu L, Wu F, Wu S, Chen G. Byzantine-robust learning on heterogeneous data via gradient splitting. In: Proceedings of the 40th International Conference on Machine Learning. 2023, 21404\u201321425"},{"key":"40924_CR9","doi-asserted-by":"publisher","first-page":"2545","DOI":"10.1145\/3534678.3539231","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Cao X, Jia J, Gong N Z. FLDetector: defending federated learning against model poisoning attacks via detecting malicious clients. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2022, 2545\u20132555"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-40924-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-40924-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-40924-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T02:34:14Z","timestamp":1746239654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-40924-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,3]]},"references-count":9,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["40924"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-40924-1","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,3]]},"assertion":[{"value":"29 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"1912371"}}