Hua Sun

The $\epsilon$-error Capacity of Symmetric PIR with Byzantine Adversaries

2018 · arXiv (Cornell University)

The capacity of symmetric private information retrieval with $K$ messages, $N$ servers (out of which any $T$ may collude), and an omniscient Byzantine adversary (who can corrupt any $B$ answers) is shown to be $1 …

Multiround Private Information Retrieval: Capacity and Storage Overhead

2016 · arXiv (Cornell University)

The capacity has recently been characterized for the private information retrieval (PIR) problem as well as several of its variants. In every case it is assumed that all the queries are generated by the user …

Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness

2019

The capacity of symmetric private information retrieval (PIR) with N servers and K messages, each coded by an (N, M)-MDS code has been characterized as CMDS-SPIR= 1- M/N . A critical assumption for this result …

Secure Aggregation with Uncoded Groupwise Keys Against User Collusion

2023

In this paper, we study the information theoretic secure aggregation problem, where the server node aims to aggregate K users' locally trained models, without revealing any other information about the users' local data. To ensure …