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…
Information-Theoretic Secure Aggregation over Regular Graphs
Xiang Zhang, Zhou Li, Han Yu +4
Large-scale decentralized learning frameworks such as federated learning (FL), require both communication efficiency and strong data security, motivating the study of secure aggreg…
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…
Optimal Rate Region for Multi-server Secure Aggregation with User Collusion
Zhou Li, Xiang Zhang, Kai Wan +3
Secure aggregation is a fundamental primitive in privacy-preserving distributed learning systems, where an aggregator aims to compute the sum of users' inputs without revealing ind…