5 papers
Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization
Xiang Zhang, Giuseppe Caire, Mingyue Ji
Finite-length design is essential for making coded caching practical, as the optimal communication gains of existing schemes often require prohibitively large subpacketization. Thi…
Optimal Communication Rate of Secure Aggregation over Ring Networks with Pairwise Keys
Xiang Zhang, Han Yu, Zhou Li +2
Information-theoretic topological secure aggregation (TSA)\cite{zhang2026information_regular} enables distributed users to compute neighborhood sums over arbitrary networks without…
Reducing Subpacketization in Device-to-Device Coded Caching via Heterogeneous File Splitting
Xiang Zhang, Giuseppe Caire, Mingyue Ji
The packet type (PT)-based framework~\cite{zhang2026taming} provides a systematic and principled approach to designing device-to-device (D2D) coded caching schemes that achieve red…
Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association
Xiang Zhang, Zhou Li, Kai Wan +3
Secure aggregation is motivated by federated learning (FL) where a cloud server aims to compute an {aggregated} model (i.e., weights of deep neural networks) of the locally-trained…
Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation with User Collusion
Xiang Zhang, Kai Wan, Hua Sun +3
Secure aggregation is concerned with the task of securely uploading the inputs of multiple users to an aggregation server without letting the server know the inputs beyond their su…