{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:51:47Z","timestamp":1776750707299,"version":"3.51.2"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100018543","name":"Natural Science Foundation of Ningxia Hui Autonomous Region","doi-asserted-by":"publisher","award":["2025AAC030535"],"award-info":[{"award-number":["2025AAC030535"]}],"id":[{"id":"10.13039\/501100018543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3683125","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:37:37Z","timestamp":1776109057000},"page":"57782-57792","source":"Crossref","is-referenced-by-count":0,"title":["Random Window Aggregation: A Privacy Protection Mechanism for Hierarchical Federated Learning in Distributed Vision Networks"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2579-6837","authenticated-orcid":false,"given":"Yuanxun","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Ningxia Institute of Science and Technology, Shizuishan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuechun","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Ningxia Institute of Science and Technology, Shizuishan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. AISTATS","author":"McMahan"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148862"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63076-8_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2019.1800286"},{"key":"ref6","first-page":"16937","article-title":"Inverting gradients-how easy is it to break privacy in federated learning?","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"33","author":"Geiping"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref8","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"30","author":"Blanchard"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/app13095821"},{"key":"ref12","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Nguyen"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3460427"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01607"},{"issue":"5","key":"ref15","first-page":"4118","article-title":"Evaluating gradient inversion attacks and defenses in federated learning","volume":"20","author":"Huang","year":"2021","journal-title":"IEEE Trans. Depend. Sec. Comput."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MSN53354.2021.00041"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.10.007"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3595185"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11480100.pdf?arnumber=11480100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:31:11Z","timestamp":1776749471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11480100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3683125","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}