{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:51Z","timestamp":1773377031977,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12141107"],"award-info":[{"award-number":["12141107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195402","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["On the Optimal Source Key Size of Secure Gradient Coding"],"prefix":"10.1109","author":[{"given":"Yang","family":"Zhou","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}]},{"given":"Wenbo","family":"Huang","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}]},{"given":"Kai","family":"Wan","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}]},{"given":"Robert Caiming","family":"Qiu","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335343"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10916-016-0574-6"},{"key":"ref8","first-page":"06","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research","volume":"70","author":"Tandon"},{"key":"ref9","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"International Conference on Machine Learning. PMLR","author":"Ye","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3085676"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142373"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SPW53761.2021.00017"},{"key":"ref13","article-title":"Communicationcomputation efficient secure aggregation for federated learning","author":"Choi","year":"2020","journal-title":"arXiv preprint"},{"key":"ref14","first-page":"694","article-title":"Lightsecagg: a lightweight and versatile design for secure aggregation in federated learning","volume":"4","author":"So","year":"2022","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834750"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192874"},{"key":"ref17","author":"Zhou","year":"2025","journal-title":"On the optimal source key size of secure gradient coding"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3122873"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195402.pdf?arnumber=11195402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:10Z","timestamp":1773347410000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195402","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}