{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T06:51:23Z","timestamp":1774767083846,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032078834","type":"print"},{"value":"9783032078841","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07884-1_7","type":"book-chapter","created":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T16:22:17Z","timestamp":1760286137000},"page":"126-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["KeTS: Kernel-Based Trust Segmentation Against Model Poisoning Attacks"],"prefix":"10.1007","author":[{"given":"Ankit","family":"Gangwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Conti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tommaso","family":"Pauselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"7_CR1","unstructured":"Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., Shmatikov, V.: How to backdoor federated learning. In: AISTATS, pp. 2938\u20132948 (2020)"},{"key":"7_CR2","unstructured":"Beutel, D.J., et\u00a0al.: Flower: a friendly federated learning research framework. arxiv:2007.14390 (2020)"},{"key":"7_CR3","unstructured":"Bhagoji, A.N., Chakraborty, S., Mittal, P., Calo, S.: Analyzing federated learning through an adversarial lens. In: ICML, pp. 634\u2013643 (2019)"},{"key":"7_CR4","unstructured":"Biggio, B., Nelson, B., Laskov, P.: Poisoning attacks against support vector machines. arxiv:1206.6389 (2012)"},{"key":"7_CR5","unstructured":"Blanchard, P., El, M., Guerraoui, R., Stainer, J.: Machine learning with adversaries: byzantine tolerant gradient descent. NeurIPS 30 (2017)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cao, X., Fang, M., Liu, J., Gong, N.Z.: Fltrust: byzantine-robust federated learning via trust bootstrapping. arxiv:2012.13995 (2020)","DOI":"10.14722\/ndss.2021.24434"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chelli, M., et al.: FedGuard: selective parameter aggregation for poisoning attack mitigation in federated learning. IEEE CLUSTER, pp. 72\u201381 (2023)","DOI":"10.1109\/CLUSTER52292.2023.00014"},{"key":"7_CR8","unstructured":"Fang, M., Cao, X., Jia, J., Gong, N.: Local model poisoning attacks to byzantine-robust federated learning. In: USENIX SEC, pp. 1\u201318 (2020)"},{"key":"7_CR9","unstructured":"Fung, C., Yoon, C.J., Beschastnikh, I.: The limitations of federated learning in sybil settings. In: RAID, pp. 301\u2013316 (2020)"},{"key":"7_CR10","unstructured":"Guerraoui, R., Rouault, S., et\u00a0al.: The hidden vulnerability of distributed learning in Byzantium. In: ICML, pp. 3521\u20133530 (2018)"},{"key":"7_CR11","unstructured":"Krizhevsky, A., Hinton, G., et\u00a0al.: Learning Multiple Layers of Features from Tiny Images. University of Toronto (2009)"},{"key":"7_CR12","unstructured":"LeCun, Y.: The MNIST database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/ (1998)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Li, L., Xu, W., Chen, T., Giannakis, G.B., Ling, Q.: RSA: byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets. In: AAAI Conf. on AI, vol.\u00a033, pp. 1544\u20131551 (2019)","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Li, Q., Diao, Y., Chen, Q., He, B.: Federated learning on non-IID data silos: an experimental study. In: IEEE ICDE, pp. 965\u2013978 (2022)","DOI":"10.1109\/ICDE53745.2022.00077"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lu, Z., Pan, H., Dai, Y., Si, X., Zhang, Y.: Federated learning with non-IID data: a survey. IEEE IoT J. 99 (2024)","DOI":"10.1109\/JIOT.2024.3376548"},{"key":"7_CR16","unstructured":"McMahan, B., Ramage, D.: Federated Learning: Collaborative Machine Learning without Centralized Training Data. Google Research Blog (2017)"},{"key":"7_CR17","unstructured":"McMahan, B., et\u00a0al.: Communication-efficient learning of deep networks from decentralized data. In: AISTATS, pp. 1273\u20131282 (2017)"},{"key":"7_CR18","unstructured":"McMahan, H.B., et\u00a0al.: Federated learning: strategies for improving communication efficiency. In: NIPS, pp.\u00a01\u20136 (2016)"},{"issue":"16","key":"7_CR19","first-page":"1","volume":"8","author":"B Nelson","year":"2008","unstructured":"Nelson, B., et al.: Exploiting machine learning to subvert your spam filter. LEET 8(16), 1\u20139 (2008)","journal-title":"LEET"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E Parzen","year":"1962","unstructured":"Parzen, E.: On estimation of a probability density function and mode. Ann. Math. Stat. 33(3), 1065\u20131076 (1962)","journal-title":"Ann. Math. Stat."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Salvatore, S., Wei, F., Wenke, L., Andreas, P., Philip, C.: KDD Cup 1999 Data. UCI Machine Learning Repository (1999). https:\/\/doi.org\/10.24432\/C51C7N","DOI":"10.24432\/C51C7N"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Sharma, A., Marchang, N.: Probabilistic sign flipping attack in federated learning. In: ICCCNT, pp.\u00a01\u20136 (2024)","DOI":"10.1109\/ICCCNT61001.2024.10725463"},{"key":"7_CR23","unstructured":"Simonyan, K., Zisserman, A.: very deep convolutional networks for large-scale image recognition. arXiv:1409.1556 (2014)"},{"key":"7_CR24","unstructured":"Virat, S., Amir, H.: Manipulating the byzantine: optimizing model poisoning attacks and defenses for federated learning. In: NDSS (2021)"},{"key":"7_CR25","unstructured":"Xiao, H., Rasul, K., Vollgraf, R.: Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms. arxiv:1708.07747 (2017)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41666-020-00082-4","volume":"5","author":"J Xu","year":"2021","unstructured":"Xu, J., et al.: Federated learning for healthcare informatics. J. Healthcare Info. Res. 5, 1\u201319 (2021)","journal-title":"J. Healthcare Info. Res."},{"key":"7_CR27","unstructured":"Yan, H., et\u00a0al.: Recess vaccine for federated learning: proactive defense against model poisoning attacks. NeurIPS 36 (2024)"},{"key":"7_CR28","unstructured":"Yin, D., et\u00a0al.: Byzantine-robust distributed learning: towards optimal statistical rates. In: ICML, pp. 5650\u20135659 (2018)"},{"key":"7_CR29","unstructured":"Yurochkin, M., et\u00a0al.: Bayesian nonparametric federated learning of neural networks. In: ICML, pp. 7252\u20137261 (2019)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07884-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T17:03:14Z","timestamp":1760288594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07884-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"ISBN":["9783032078834","9783032078841"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07884-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,13]]},"assertion":[{"value":"13 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.esorics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}