research
∙
07/25/2023
Secure Aggregation with an Oblivious Server
Secure aggregation usually aims at securely computing the sum of the inp...
share
research
∙
05/09/2023
On Multi-Message Private Computation
In a typical formulation of the private information retrieval (PIR) prob...
research
∙
05/09/2023
Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment
Distributed Linearly Separable Computation problem under the cyclic assi...
research
∙
04/19/2023
Weakly Secure Summation with Colluding Users
In secure summation, K users, each holds an input, wish to compute the s...
research
∙
01/05/2023
A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems
We consider the storage-retrieval rate tradeoff in private information r...
research
∙
11/02/2022
MDS Variable Generation and Secure Summation with User Selection
A collection of K random variables are called (K,n)-MDS if any n of the ...
research
∙
10/12/2022
On Extremal Rates of Storage over Graphs
A storage code over a graph maps K independent source symbols, each of L...
research
∙
05/17/2022
Secure Summation: Capacity Region, Groupwise Key, and Feasibility
The secure summation problem is considered, where K users, each holds an...
research
∙
04/24/2022
Information Theoretic Secure Aggregation with Uncoded Groupwise Keys
Secure aggregation, which is a core component of federated learning, agg...
research
∙
04/13/2022
On Extremal Rates of Secure Storage over Graphs
A secure storage code maps K source symbols, each of L_w bits, to N code...
research
∙
01/27/2022
Coded Caching with Private Demands and Caches
Coded caching has been shown as a promissing method to reduce the networ...
research
∙
06/08/2021
On the Linear Capacity of Conditional Disclosure of Secrets
Conditional disclosure of secrets (CDS) is the problem of disclosing as ...
research
∙
02/08/2021
Multilevel Topological Interference Management: A TIM-TIN Perspective
The robust principles of treating interference as noise (TIN) when it is...
research
∙
02/02/2021
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching
In the problem of cache-aided multiuser private information retrieval (M...
research
∙
02/01/2021
On Secure Distributed Linearly Separable Computation
Distributed linearly separable computation, where a user asks some distr...
research
∙
01/19/2021
Information Theoretic Secure Aggregation with User Dropouts
In the robust secure aggregation problem, a server wishes to learn and o...
research
∙
01/13/2021
Two-Level Private Information Retrieval
In the conventional robust T-colluding private information retrieval (PI...
research
∙
12/28/2020
Cache-aided General Linear Function Retrieval
Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potentia...
research
∙
10/13/2020
On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval
We consider the problem of cache-aided Multiuser Private Information Ret...
research
∙
10/04/2020
On the Tradeoff Between Computation and Communication Costs for Distributed Linearly Separable Computation
This paper studies the distributed linearly separable computation proble...
research
∙
07/02/2020
Cache-Aided Matrix Multiplication Retrieval
Coded caching is a promising technique to smooth out network traffic by ...
research
∙
07/01/2020
Distributed Linearly Separable Computation
This paper formulates a distributed computation problem, where a master ...
research
∙
06/10/2020
Secure Groupcast: Extra-Entropic Structure and Linear Feasibility
In the secure groupcast problem, a transmitter wants to securely groupca...
research
∙
04/30/2020
Compound Secure Groupcast: Key Assignment for Selected Broadcasting
The compound secure groupcast problem is considered, where the key varia...
research
∙
03/26/2020
Secure Groupcast with Shared Keys
We consider a transmitter and K receivers, each of which shares a key va...
research
∙
02/13/2020
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach
In the conditional disclosure of secrets (CDS) problem, Alice and Bob (e...
research
∙
01/10/2020
On Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval
Coded caching has the potential to greatly reduce network traffic by lev...
research
∙
01/02/2020
Expand-and-Randomize: An Algebraic Approach to Secure Computation
We consider the secure computation problem in a minimal model, where Ali...
research
∙
12/19/2019
Fundamental Limits of Device-to-Device Private Caching with Trusted Server
In the coded caching problem as originally formulated by Maddah-Ali and ...
research
∙
09/26/2019
Device-to-Device Private Caching with Trusted Server
In order to preserve the privacy of the users demands from other users, ...
research
∙
08/19/2019
Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding
The capacity of private information retrieval (PIR) from databases coded...
research
∙
03/19/2019
Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size
We consider constructing capacity-achieving linear codes with minimum me...
research
∙
03/18/2019
On the Capacity of Computation Broadcast
The two-user computation broadcast problem is introduced as the setting ...
research
∙
12/13/2018
On the Capacity of Locally Decodable Codes
A locally decodable code (LDC) maps K source symbols, each of size L_w b...
research
∙
09/11/2018
The ε-error Capacity of Symmetric PIR with Byzantine Adversaries
The capacity of symmetric private information retrieval with K messages,...
research
∙
08/27/2018
Opportunistic Treating Interference as Noise
We consider a K-user interference network with M states, where each tran...
research
∙
08/22/2018
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost
We propose a new capacity-achieving code for the private information ret...
research
∙
08/22/2018
Cross Subspace Alignment and the Asymptotic Capacity of X-Secure T-Private Information Retrieval
X-secure and T-private information retrieval (XSTPIR) is a form of priva...
research
∙
06/14/2018
Anonymous Information Delivery
We introduce the problem of anonymous information delivery (AID), compri...
research
∙
04/26/2018
The Capacity of Private Information Retrieval with Eavesdroppers
We consider the problem of private information retrieval (PIR) with coll...
research
∙
04/04/2018