Journal article · 2025 · Open access

Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion

Xiang Zhang, Kai Wan, Hua Sun, Shiqiang Wang, Mingyue Ji, Giuseppe Caire

IEEE Transactions on Information Theory, 72(2), 1030–1050 · Published 26 December 2025 · DOI 10.1109/tit.2025.3648767

Open PDFView at the publisherCite this paper

In brief

“Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion” is a 2025 journal article by Xiang Zhang and 5 co-authors, published in IEEE Transactions on Information Theory. OpenAlex counts 26 citations as of 17 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
26
Most cited in
2026 (18)
Field-weighted impact
5.37
References
51
Authors
6

Abstract

Secure aggregation is concerned with the task of securely computing the sum of the inputs from multiple users by an aggregation server without letting the server know the inputs beyond their summation. It finds broad applications in distributed machine learning paradigms such as federated learning (FL) where numerous clients, each holding a proprietary dataset, periodically upload their locally trained models (abstracted as inputs) to a parameter server. The server then generates an aggregate model, typically through averaging, which is shared back with clients as the starting point for a new round of local training. To protect data security, secure aggregation protocols leverage cryptographic techniques to ensure the server gains no additional information beyond the input sum, even if it colludes with a subset of users. While the simple star client-server architecture provides insights into the fundamental utility-security trade-off in secure aggregation, it falls short of capturing the impact of network topology in practical systems. Motivated by hierarchical federated learning, we investigate the secure aggregation problem in a three-layer hierarchical network, where clustered users communicate with an aggregation server via an intermediate layer of relays. In addition to conventional server security which ensures the server learns only the input sum, we also impose relay security, requiring that the relays remain oblivious to users’ inputs. For such a hierarchical secure aggregation (HSA) problem, we characterize the optimal multifaceted trade-off between communication efficiency (measured by user-to-relay and relay-to-server communication rates) and key generation efficiency (including individual and source key rates). A core contribution of this work is the derivation of the optimal source key rate as a function of the number of relays, cluster size, and collusion level. We propose an optimal communication scheme alongside a key generation scheme utilizing a novel matrix structure called extended Vandermonde matrix that guarantees both input sum recovery and security. Moreover, we derive a tight information-theoretic converse proof to establish the optimal rate region for the HSA problem.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhang, X., Wan, K., Sun, H., Wang, S., Ji, M., & Caire, G. (2025). Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion. IEEE Transactions on Information Theory, 72(2), 1030–1050. https://doi.org/10.1109/tit.2025.3648767

MLA 9

Zhang, Xiang, et al. “Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion.” IEEE Transactions on Information Theory, vol. 72, no. 2, 2025, pp. 1030–1050. https://doi.org/10.1109/tit.2025.3648767.

Chicago

Zhang, Xiang, Kai Wan, Hua Sun, Shiqiang Wang, Mingyue Ji, and Giuseppe Caire. 2025. “Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion.” IEEE Transactions on Information Theory 72 (2): 1030–1050. https://doi.org/10.1109/tit.2025.3648767.

Harvard

Zhang, X. et al. (2025) ‘Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion’, IEEE Transactions on Information Theory, 72(2), pp. 1030–1050. doi:10.1109/tit.2025.3648767.

IEEE

X. Zhang, K. Wan, H. Sun, S. Wang, M. Ji, and G. Caire, “Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion,” IEEE Transactions on Information Theory, vol. 72, no. 2, pp. 1030–1050, 2025, doi: 10.1109/tit.2025.3648767.

BibTeX

@article{zhang2025optimal,
  title     = {{Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion}},
  author    = {Zhang, Xiang and Wan, Kai and Sun, Hua and Wang, Shiqiang and Ji, Mingyue and Caire, Giuseppe},
  journal   = {IEEE Transactions on Information Theory},
  year      = {2025},
  volume    = {72},
  number    = {2},
  pages     = {1030--1050},
  doi       = {10.1109/tit.2025.3648767},
  url       = {https://doi.org/10.1109/tit.2025.3648767}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202422
202566
20261818

Its field-weighted citation impact is 5.37: it has been cited 5.37 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security

  • secure aggregation
  • hierarchical federated learning
  • communication efficiency
  • rate region
  • network topology

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Zhang, X., Wan, K., Sun, H., Wang, S., Ji, M., & Caire, G. (2025). Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation With User Collusion. IEEE Transactions on Information Theory, 72(2), 1030–1050. https://doi.org/10.1109/tit.2025.3648767

How many times has this paper been cited?

26 times, according to OpenAlex on 17 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Xiang Zhang, Kai Wan, Hua Sun, Shiqiang Wang, Mingyue Ji, Giuseppe Caire.

What is the DOI of this paper?

10.1109/tit.2025.3648767, permanently at https://doi.org/10.1109/tit.2025.3648767. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 17 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.