35 citations · 300 across the 51 of their papers we have counts for
5 papers · 1 filter
Secure Aggregation with an Oblivious Server
Hua Sun
Secure aggregation usually aims at securely computing the sum of the inputs from users at a server. Noticing that the sum might inevitably reveal information about the inputs (…
Fundamental Limits of Multi-Message Private Computation
Ali Gholami, Kai Wan, Tayyebeh Jahani-Nezhad +3
In a typical formulation of the private information retrieval (PIR) problem, a single user wishes to retrieve one out of files from servers without revealing the demanded…
Fundamental Limits of Distributed Linearly Separable Computation under Cyclic Assignment
Wenbo Huang, Kai Wan, Hua Sun +3
This paper studies the master-worker distributed linearly separable computation problem, where the considered computation task, referred to as linearly separable function, is a typ…
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…
A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems
Chao Tian, Hua Sun, Jun Chen
We consider the storage-retrieval rate tradeoff in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message…