{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:06:26Z","timestamp":1777705586569,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:00:00Z","timestamp":1777420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:00:00Z","timestamp":1777420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Vietnam National University Ho Chi Minh City"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"DOI":"10.1007\/s10207-026-01257-7","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:44Z","timestamp":1777455824000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RADAR: Robust aggregation with dynamic adversarial-resilient routing decentralized federated learning"],"prefix":"10.1007","volume":"25","author":[{"given":"Duc Dung","family":"Truong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ba Hoang","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dinh Tien","family":"Ta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trong Nhan","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thi Ai Thao","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,29]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"crossref","unstructured":"Fang, M., Khanduri, P., Zhang, Z., Liu, J., Liu, Y., Gong, N.: Byzantine-robust decentralized federated learning. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 2874-2888 (2024)","DOI":"10.1145\/3658644.3670307"},{"key":"1257_CR2","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez Beltr\u00e1n, E. T., S\u00e1nchez S\u00e1nchez, P. M., L\u00f3pez Bernal, S., Bovet, G., Gil P\u00e9rez, M., Mart\u00ednez P\u00e9rez, G., and Huertas Celdr\u00e1n, A.: Mitigating communications threats in decentralized federated learning through moving target defense. arXiv:2307.11730 (2023)","DOI":"10.1007\/s11276-024-03667-8"},{"key":"1257_CR3","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez Beltr\u00e1n, E.T., Perales G\u00f3mez, \u00c1.L., Feng, C., S\u00e1nchez S\u00e1nchez, P.M., L\u00f3pez Bernal, S., Bovet, G., Gil P\u00e9rez, M., Mart\u00ednez P\u00e9rez, G., Huertas Celdr\u00e1n, A.: Fedstellar: A platform for decentralized federated learning. arXiv:2306.09750 (2024)","DOI":"10.1016\/j.eswa.2023.122861"},{"key":"1257_CR4","doi-asserted-by":"crossref","unstructured":"Zhu, L., Liu, Z., Han, S.: Deep leakage from gradients. arXiv:1906.08935 (2019)","DOI":"10.1007\/978-3-030-63076-8_2"},{"key":"1257_CR5","unstructured":"CodesInChaos (2011). How to fairly select a random number for a game without trusting a third party? https:\/\/crypto.stackexchange.com\/a\/769, accessed 2025\/06\/08"},{"key":"1257_CR6","first-page":"11","volume":"81","author":"M Blum","year":"1981","unstructured":"Blum, M.: Coin Flipping by Telephone: A Protocol for Solving Impossible Problems. Advances in Cryptology: A Report on CRYPTO 81, 11\u201315 (1981)","journal-title":"Advances in Cryptology: A Report on CRYPTO"},{"key":"1257_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the Security of Coin Flips When Half the Processors Are Faulty. Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), 364-369 (1986)","DOI":"10.1145\/12130.12168"},{"issue":"3","key":"1257_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"Moran, T., Naor, M., Segev, G.: An Optimally Fair Coin Toss. J. Cryptol. 29(3), 491\u2013513 (2016). https:\/\/doi.org\/10.1007\/s00145-015-9199-z","journal-title":"J. Cryptol."},{"key":"1257_CR9","doi-asserted-by":"crossref","unstructured":"Haitner, I., Makriyannis, N., Omri, E.: On the Complexity of Fair Coin Flipping. arXiv:2105.00743 (2021)","DOI":"10.1016\/j.tcs.2022.02.010"},{"key":"1257_CR10","unstructured":"poncho.: What are the pros and cons of Pedersen commitments vs hash-based commitments? https:\/\/crypto.stackexchange.com\/a\/106779, accessed 2025\/06\/08 (2018)"},{"key":"1257_CR11","unstructured":"Wikipedia contributors: Transport Layer Security. Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Transport_Layer_Security, accessed 2025\/06\/08 (2024)"},{"issue":"4","key":"1257_CR12","doi-asserted-by":"publisher","first-page":"2860","DOI":"10.1109\/COMST.2023.3315746","volume":"25","author":"ET Mart\u00ednez Beltr\u00e1n","year":"2023","unstructured":"Mart\u00ednez Beltr\u00e1n, E.T., Quiles P\u00e9rez, M., S\u00e1nchez S\u00e1nchez, P.M., L\u00f3pez Bernal, S., Bovet, G., Gil P\u00e9rez, M., Mart\u00ednez P\u00e9rez, G., Huertas Celdr\u00e1n, A.: Decentralized federated learning: Fundamentals, state of the art, frameworks, trends, and challenges. IEEE Communications Surveys & Tutorials 25(4), 2860\u20132896 (2023)","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1257_CR13","unstructured":"Authors from SCIRP: Advances, challenges & recent developments in federated learning. Scientific Research Publishing (2024)"},{"issue":"2","key":"1257_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TBDATA.2024.3362191","volume":"10","author":"E Hallaji","year":"2024","unstructured":"Hallaji, E., Razavi-Far, R., Saif, M., Wang, B., Yang, Q.: Decentralized federated learning: A survey on security and privacy. IEEE Transactions on Big Data 10(2), 194\u2013213 (2024)","journal-title":"IEEE Transactions on Big Data"},{"key":"1257_CR15","doi-asserted-by":"crossref","unstructured":"Shokri, R., Stronati, M., Song, C., Shmatikov, V.: Membership inference attacks against machine learning models. arXiv:1610.05820 (2017)","DOI":"10.1109\/SP.2017.41"},{"issue":"6","key":"1257_CR16","doi-asserted-by":"publisher","first-page":"4096","DOI":"10.1109\/TCSVT.2021.3116976","volume":"32","author":"S Guo","year":"2021","unstructured":"Guo, S., Zhang, T., Yu, H., Xie, X., Ma, L., Xiang, T., Liu, Y.: Byzantine-resilient decentralized stochastic gradient descent. IEEE Trans. Circuits Syst. Video Technol. 32(6), 4096\u20134106 (2021)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"1257_CR17","unstructured":"El-Mhamdi, E.M., Farhadkhani, S., Guerraoui, R., Guirguis, A., Hoang, L.-N., Rouault, S.: Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning). In Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"1257_CR18","unstructured":"He, L., Karimireddy, S.P., Jaggi, M.: Byzantine-robust decentralized learning via self-centered clipping. (2023) arXiv:2202.01545"},{"key":"1257_CR19","unstructured":"Dai, R., Shen, L., He, F., Tian, X., Tao, D.: Dispfl: Towards communication-efficient personalized federated learning via decentralized sparse training. arXiv:2206.00187 (2022)"},{"key":"1257_CR20","unstructured":"Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., Shmatikov, V.: How to backdoor federated learning. In International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 2938-2948. PMLR (2020)"},{"key":"1257_CR21","unstructured":"Fang, M., Cao, X., Jia, J., Gong, N.: Local model poisoning attacks to byzantine-robust federated learning. In 29th USENIX Security Symposium (USENIX Security 20), pp. 1605-1622 (2020)"},{"key":"1257_CR22","unstructured":"Blanchard, P., El Mhamdi, E. M., Guerraoui, R., Stainer, J.: Machine learning with adversaries: Byzantine tolerant gradient descent. In Advances in Neural Information Processing Systems (NeurIPS), 30 (2017)"},{"key":"1257_CR23","unstructured":"Yin, D., Chen, Y., Kannan, R., Bartlett, P.: Byzantine-robust distributed learning: Towards optimal statistical rates. In International Conference on Machine Learning (ICML), pp. 5650-5659. PMLR (2018)"},{"key":"1257_CR24","doi-asserted-by":"crossref","unstructured":"Ballot, G., Malvone, V., Leneutre, J., Borde, E.: Reasoning about moving target defense in attack modeling formalisms. In Proceedings of the 9th ACM Workshop on Moving Target Defense, pp. 55-65 (2022)","DOI":"10.1145\/3560828.3564009"},{"key":"1257_CR25","unstructured":"Ye, Z.: Mitigating poisoning attacks in decentralized federated learning through moving target defense. Master\u2019s thesis, University of Zurich (2024)"},{"issue":"1","key":"1257_CR26","first-page":"100","volume":"22","author":"H Okhravi","year":"2016","unstructured":"Okhravi, H., Streilein, W.W., Bauer, K.S.: Moving target techniques: Leveraging uncertainty for cyber defense. Lincoln Laboratory Journal 22(1), 100\u2013109 (2016)","journal-title":"Lincoln Laboratory Journal"},{"key":"1257_CR27","doi-asserted-by":"crossref","unstructured":"Feng, C., Huertas Celdr\u00e1n, A., Vuong, M., Bovet, G., Stiller, B.: Voyager: MTD-based aggregation protocol for mitigating poisoning attacks on DFL. In Proceedings of the IEEE Network Operations and Management Symposium (NOMS 2024), pp. 1-9. IEEE (2024)","DOI":"10.1109\/NOMS59830.2024.10575335"},{"key":"1257_CR28","unstructured":"Zhao, Y., Li, M., Lai, L., Suda, N., Civin, D., Chandra, V.: Federated learning with non-IID data. arXiv:1806.00582 (2018)"},{"key":"1257_CR29","doi-asserted-by":"crossref","unstructured":"Feng, C., Huertas Celdr\u00e1n, A., Zeng, Z., Ye, Z., von der Assen, J., Bovet, G., Stiller, B.: Leveraging MTD to mitigate poisoning attacks in decentralized FL with non-IID data. In Proceedings of the 2024 IEEE International Conference on Big Data (BigData), pp. 7745-7754. IEEE (2024)","DOI":"10.1109\/BigData62323.2024.10825953"},{"key":"1257_CR30","doi-asserted-by":"crossref","unstructured":"Shi, C., Zhao, H., Zhang, B., Zhou, M., Guo, D., Chang, Y.: FedAWA: Adaptive optimization of aggregation weights in federated learning using client vectors. In Proceedings of the Computer Vision and Pattern Recognition Conference, pp. 30651-30660. (2025)","DOI":"10.1109\/CVPR52734.2025.02854"},{"key":"1257_CR31","unstructured":"Xu, M., Cao, X., Tsang, I. W., Kwok, J.T.: Aggregation weighting of federated learning via generalization bound estimation. (2023). arXiv:2311.05936"},{"key":"1257_CR32","unstructured":"LeCun, Y.: MNIST handwritten digit database. ATT Labs (2010)"},{"key":"1257_CR33","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In Artificial Intelligence and Statistics, pp. 1273-1282. PMLR (2017)"},{"key":"1257_CR34","unstructured":"Wang, S., Ji, M.: A unified analysis of federated learning with arbitrary client participation. (2024). arXiv:2205.13648"},{"key":"1257_CR35","unstructured":"Lalitha, A., Kilinc, O.C., Javidi, T., Koushanfar, F.: Peer-to-peer Federated Learning on Graphs. (2019). arXiv:1901.11173"},{"issue":"1\u20132","key":"1257_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000083","volume":"14","author":"P Kairouz","year":"2021","unstructured":"Kairouz, P., McMahan, H.B., Avent, B., Bellet, A., Bennis, M., et al.: Advances and open problems in federated learning. Foundations and Trends in Machine Learning 14(1\u20132), 1\u2013210 (2021)","journal-title":"Foundations and Trends in Machine Learning"},{"key":"1257_CR37","unstructured":"Hardy, S., Henecka, W., Ivey-Law, H., Nock, R., Patrini, G., Smith, G., Thorne, B.: Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv:1711.10677 (2017)"},{"key":"1257_CR38","doi-asserted-by":"crossref","unstructured":"Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., Seth, K.: Practical secure aggregation for privacy-preserving machine learning. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1175-1191 (2017)","DOI":"10.1145\/3133956.3133982"},{"issue":"3\u20134","key":"1257_CR39","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science 9(3\u20134), 211\u2013407 (2014)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"2","key":"1257_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3377454","volume":"53","author":"J Verbraeken","year":"2020","unstructured":"Verbraeken, J., Wolting, M., Katzy, J., Kloppenburg, J., Verbelen, T., Rellermeyer, J.S.: A survey on distributed machine learning. ACM Comput. Surv. 53(2), 1\u201333 (2020)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"1257_CR41","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MSP.2020.2975749","volume":"37","author":"T Li","year":"2022","unstructured":"Li, T., Sahu, A.K., Talwalkar, A., Smith, V.: Federated learning: Challenges, methods, and future directions. IEEE Signal Process. Mag. 37(3), 50\u201360 (2022)","journal-title":"IEEE Signal Process. Mag."},{"key":"1257_CR42","unstructured":"Brown, D.: Standards for efficient cryptography, SEC 1: elliptic curve cryptography. Released Standard Version, 1 (2009)"},{"key":"1257_CR43","doi-asserted-by":"crossref","unstructured":"Barnes, R., Hoffman-Andrews, J., McCarney, D., Kasten, J.: Automatic certificate management environment (ACME). RFC 8555, RFC Editor (2019)","DOI":"10.17487\/RFC8555"},{"key":"1257_CR44","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A.: Recommendation for key management: Part 1-general (Revision 5). NIST Special Publication 800-57 Part 1, National Institute of Standards and Technology (2020)"},{"key":"1257_CR45","unstructured":"National Institute of Standards and Technology: Security requirements for cryptographic modules. FIPS PUB 140-2 (2001)"},{"issue":"11","key":"1257_CR46","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"1257_CR47","doi-asserted-by":"crossref","unstructured":"Laurie, B., Langley, A., Kasper, E.: Certificate transparency. RFC 6962, RFC Editor (2013)","DOI":"10.17487\/rfc6962"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-026-01257-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-026-01257-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-026-01257-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:44:20Z","timestamp":1777455860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-026-01257-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,29]]},"references-count":47,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s10207-026-01257-7","relation":{},"ISSN":["1615-5270"],"issn-type":[{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,29]]},"assertion":[{"value":"21 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"86"}}