28 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…
A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology
Ting Yang, Kai Wan, Minquan Cheng +3
This paper studies the multi-access coded caching (MACC) problem with arbitrary user-cache access topology, which extends existing MACC models that rely on highly structured and co…
On Secure Gradient Coding with Uncoded Groupwise Keys
Xudong You, Kai Wan, Xiang Zhang +3
This paper considers a new secure gradient coding problem with uncoded groupwise keys, formalized as a (K, N, N_r, M, S) secure gradient coding model, where a user aims to compute…
A New Construction Structure on Multi-access Coded Caching with Linear Subpacketization: Cyclic Multi-Access Non-Half-Sum Disjoint Packing
Mengyuan Li, Minquan Cheng, Kai Wan +1
We consider the multi-access coded caching system introduced by Hachem et al., which consists of a central server with files and cache nodes, each of memory siz…
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…