{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:35Z","timestamp":1773376895084,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2007108,CCF-2045656,CCF-2312228,2312227,2145835"],"award-info":[{"award-number":["CCF-2007108,CCF-2045656,CCF-2312228,2312227,2145835"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619337","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2730-2735","source":"Crossref","is-referenced-by-count":1,"title":["On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion"],"prefix":"10.1109","author":[{"given":"Ziting","family":"Zhang","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayu","family":"Liu","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wan","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology,Wuhan,China,430074"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[{"name":"University of North Texas,Denton,TX,USA,76203"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mingyue","sequence":"additional","affiliation":[{"name":"University of Utah,Salt Lake City,UT,USA,84112"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technische Universitat Berlin,Berlin,Germany,10587"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017","journal-title":"Artificial intelligence and statistics"},{"key":"ref2","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proceedings of machine learning and systems","volume":"1","author":"Bonawitz","year":"2019"},{"key":"ref3","article-title":"Federated learning: Strategies for improving communication efficiency","author":"Konecny","year":"2016","journal-title":"arXiv preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref5","first-page":"16937","article-title":"Inverting gradients-how easy is it to break privacy in federated learning?","volume":"33","author":"Geiping","year":"2020","journal-title":"Ad-vances in Neural Information Processing Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3190835"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/116.00000063"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192874"},{"key":"ref10","article-title":"LightSecAgg: a lightweight and versatile design for secure aggregation in federated Iearning","author":"So","year":"2022","journal-title":"arXiv"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3422087"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"key":"ref16","article-title":"The capacity region of information theoretic secure aggregation with uncoded groupwise keys","author":"Wan","year":"2023","journal-title":"arXiv preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCS57501.2023.10151414"},{"key":"ref18","volume-title":"Appendix of on the optimality of secure aggregation with uncoded groupwise keys against user dropouts and user collusion","author":"Zhang","year":"2024"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619337.pdf?arnumber=10619337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:03Z","timestamp":1773347343000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619337","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}