{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:42:30Z","timestamp":1774046550979,"version":"3.50.1"},"reference-count":41,"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\/100012547","name":"Guangxi Natural Science Foundation","doi-asserted-by":"publisher","award":["2024JJB170055"],"award-info":[{"award-number":["2024JJB170055"]}],"id":[{"id":"10.13039\/100012547","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Jiangsu Natural Science Foundation","doi-asserted-by":"publisher","award":["BK20241452"],"award-info":[{"award-number":["BK20241452"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"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-2045656,CCF-2312228,2145835,2312227"],"award-info":[{"award-number":["CCF-2045656,CCF-2312228,2145835,2312227"]}],"id":[{"id":"10.13039\/100000001","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.11195652","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":2,"title":["Communication-Efficient Hierarchical Secure Aggregation with Cyclic User Association"],"prefix":"10.1109","author":[{"given":"Xiang","family":"Zhang","sequence":"first","affiliation":[{"name":"Technical University of Berlin,Department of Electrical Engineering and Computer Science"}]},{"given":"Zhou","family":"Li","sequence":"additional","affiliation":[{"name":"Guangxi University,Guangxi Key Laboratory of Multimedia Communications and Network Technology"}]},{"given":"Kai","family":"Wan","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[{"name":"University of North Texas,Department of Electrical Engineering"}]},{"given":"Mingyue","family":"Ji","sequence":"additional","affiliation":[{"name":"University of Florida,Department of Electrical and Computer Engineering"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technical University of Berlin,Department of Electrical Engineering and Computer Science"}]}],"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","article-title":"Federated learning: Strategies for improving communication efficiency,","volume":"8","author":"Konecn\u1ef3","year":"2016","journal-title":"arXiv preprint"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41746-020-00323-1"},{"key":"ref5","article-title":"Applied federated learning: Improving google keyboard query suggestions","author":"Yang","year":"2018","journal-title":"arXiv preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3075203"},{"key":"ref7","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":"Advances in neural information processing systems"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.007"},{"key":"ref9","article-title":"Practical secure aggregation for federated learning on user-held data","author":"Bonawitz","year":"2016","journal-title":"arXiv preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192874"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2991416"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3037194"},{"key":"ref15","first-page":"17455","article-title":"Differentially private learning with adaptive clipping","volume":"34","author":"Andrew","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2023.3342095"},{"key":"ref17","article-title":"Differential privacy in hierarchical federated learning: A formal analysis and evaluation","author":"Lin","year":"2024","journal-title":"arXiv e-prints, pp. arXiv \u20132401"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref19","article-title":"Fastsecagg: Scalable secure aggregation for privacy-preserving federated learning","author":"Kadhe","year":"2020","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3151126"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3163592"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3242702"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref24","first-page":"694","article-title":"Lightsecagg: a lightweight and versatile design for secure aggregation in federated learning","volume-title":"Proceedings of Machine Learning and Systems","volume":"4","author":"So"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834750"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3342571"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3393740"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3393740"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3541551"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206914"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206930"},{"key":"ref32","article-title":"Secure aggregation with an oblivious server","author":"Sun","year":"2023","journal-title":"arXiv preprint"},{"key":"ref33","article-title":"Optimal communication and key rate region for hierarchical secure aggregation with user collusion","author":"Zhang","year":"2024","journal-title":"arXiv preprint"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206717"},{"key":"ref35","article-title":"Private aggregation in hierarchical wireless federated learning with partial and full collusion","author":"Egger","year":"2024"},{"key":"ref36","article-title":"Capacity of hierarchical secure coded gradient aggregation with straggling communication links","author":"Lu","year":"2024","journal-title":"arXiv preprint"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2633253"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3332597"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC57260.2024.10570537"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref41","article-title":"Fundamental limits of hierarchical secure aggregation with cyclic user association","author":"Zhang","year":"2025","journal-title":"arXiv preprint"}],"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\/11195652.pdf?arnumber=11195652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:55Z","timestamp":1773347395000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195652","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}