{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T14:40:53Z","timestamp":1786113653725,"version":"3.56.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,9]]},"DOI":"10.1109\/icc51166.2024.10622175","type":"proceedings-article","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T15:34:42Z","timestamp":1724168082000},"page":"4620-4625","source":"Crossref","is-referenced-by-count":7,"title":["FedSV: Byzantine-Robust Federated Learning via Shapley Value"],"prefix":"10.1109","author":[{"given":"Khaoula","family":"Otmani","sequence":"first","affiliation":[{"name":"CERI\/LIA, Université d’ Avignon,Avignon,France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachid","family":"El-Azouzi","sequence":"additional","affiliation":[{"name":"CERI\/LIA, Université d’ Avignon,Avignon,France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Labatut","sequence":"additional","affiliation":[{"name":"CERI\/LIA, Université d’ Avignon,Avignon,France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3543873.3587681"},{"key":"ref2","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decen-tralized data","volume-title":"20th International Conference on Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research","volume":"54","author":"McMahan","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683546"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s41666-020-00082-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref7","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"International Conference on Machine Learning, ser. Proceedings of Machine Learning Research","volume":"80","author":"Yin","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3153135"},{"key":"ref9","first-page":"3151","article-title":"Byzantine-robust federated learning with optimal statistical rates","volume-title":"26th International Conference on Artificial Intelligence and Statistics, ser. Proceedings of Machine Learning Research","volume":"206","author":"Zhu","year":"2023"},{"key":"ref10","article-title":"A little is enough: Circumventing defenses for distributed learning","volume":"32","author":"Baruch","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00057"},{"key":"ref12","article-title":"FLAME: Taming backdoors in federated learning","author":"Duc Nguyen","year":"2021","journal-title":"Cryptology ePrint Archive, Paper 2021\/025"},{"key":"ref13","author":"Xhemrishi","year":"2023","journal-title":"FedGT: Identification of malicious clients in federated learning with secure aggregation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3212174"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.017.2100714"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS52092.2021.9521339"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.05.003"},{"issue":"43","key":"ref18","first-page":"1","article-title":"Sampling permutations for Shapley value estimation","volume":"23","author":"Mitchell","year":"2022","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","article-title":"Notes on the n-person game - II: The value of an n-person","volume-title":"Rand Corporation, Research Report RM-670-PR","author":"Shapley","year":"1951"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/sp46214.2022.9833647"},{"key":"ref21","volume-title":"Addressing the computational issues of the Shapley value with applications in the smart grid","author":"Maleki","year":"2015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref23","author":"Li","year":"2020","journal-title":"Learning to detect malicious clients for robust federated learning"},{"key":"ref24","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume":"30","author":"Blanchard","year":"2017","journal-title":"Ad-vances in Neural Information Processing Systems"}],"event":{"name":"ICC 2024 - IEEE International Conference on Communications","location":"Denver, CO, USA","start":{"date-parts":[[2024,6,9]]},"end":{"date-parts":[[2024,6,13]]}},"container-title":["ICC 2024 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10622104\/10622158\/10622175.pdf?arnumber=10622175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T19:53:15Z","timestamp":1724961195000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10622175\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icc51166.2024.10622175","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]}}}