activity
20202026
most citedExpand-and-Randomize: An Algebraic Approach to Secure Computation

5 citations · 11 across the 10 of their papers we have counts for

collaborators

10 papers

cs.IT2026

Information-Theoretic Decentralized Secure Aggregation with User Dropouts

Zhou Li, Xiang Zhang, Yizhou Zhao +2

This paper investigates the fundamental limits of information-theoretic decentralized secure aggregation (DSA) with user dropouts. We consider a fully decentralized network where $…

cs.IT2026

On the Fundamental Limits of Hierarchical Secure Aggregation with Dropout and Collusion Resilience

Zhou Li, Yizhou Zhao, Xiang Zhang +1

We study the fundamental communication limits of information-theoretic secure aggregation in a hierarchical network consisting of a server, multiple relays, and multiple users per…

cs.IT2025

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…

cs.CR2025

Robust Spectral Watermark for Synthetic Tabular Data

Yizhou Zhao, Xiang Li, Peter Song +2

The rise of generative AI has enabled the production of high-fidelity synthetic tabular data across fields such as healthcare, finance, and public policy, raising growing concerns…

cs.IT2025

Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication

Shudi Weng, Chao Ren, Yizhou Zhao +2

This work studies privacy-preserving federated learning (ppFL) under unreliable communication. In ppFL, zero-sum privacy noises enables privacy protection without sacrificing model…

cs.IT2023

Weakly Secure Summation with Colluding Users

Zhou Li, Yizhou Zhao, Hua Sun

In secure summation, users, each holds an input, wish to compute the sum of the inputs at a server without revealing any information about {\em all the inputs} even if the serv…

cs.IT2022★ 2 cited

MDS Variable Generation and Secure Summation with User Selection

Yizhou Zhao, Hua Sun

A collection of random variables are called -MDS if any of the variables are independent and determine all remaining variables. In the MDS variable generation pr…

cs.IT2022

Secure Summation: Capacity Region, Groupwise Key, and Feasibility

Yizhou Zhao, Hua Sun

The secure summation problem is considered, where users, each holds an input, wish to compute the sum of their inputs at a server securely, i.e., without revealing any informat…

cs.IT2021★ 4 cited

Information Theoretic Secure Aggregation with User Dropouts

Yizhou Zhao, Hua Sun

In the robust secure aggregation problem, a server wishes to learn and only learn the sum of the inputs of a number of users while some users may drop out (i.e., may not respond).…

cs.IT2020★ 5 cited

Expand-and-Randomize: An Algebraic Approach to Secure Computation

Yizhou Zhao, Hua Sun

We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without reve…