7 papers
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…
On the Extremal Source Key Rates for Secure Storage over Graphs
Zhou Li
This paper investigates secure storage codes over graphs, where multiple independent source symbols are encoded and stored at graph nodes subject to edge-wise correctness and secur…
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…
Optimal Key Rates for Decentralized Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints
Zhou Li, Xiang Zhang, Giuseppe Caire
Decentralized secure aggregation (DSA) considers a fully-connected network of users, where each pair of users can communicate bidirectionally over an error-free channel. Each u…
The Capacity of Collusion-Resilient Decentralized Secure Aggregation with Groupwise Keys
Zhou Li, Xiang Zhang, Yizhou Zhao +3
This paper investigates the information-theoretic decentralized secure aggregation (DSA) problem under practical groupwise secret keys and collusion resilience. In DSA, users a…
Graph-Theoretic Characterization of Noise Capacity of Conditional Disclosure of Secrets
Zhou Li, Siyan Qin, Xiang Zhang +3
In the Conditional Disclosure of Secrets (CDS) problem, Alice and Bob hold inputs and and share a secret. Let $f:\mathcal{X}\times\mathcal{Y}\…