Qiwen Wang

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 …

Secure symmetric private information retrieval from colluding databases with adversaries

2017

The problem of symmetric private information retrieval (SPIR) from replicated databases with colluding servers and adversaries is studied. Specifically, the database comprises K files, which are replicatively stored among N servers. A user wants to …

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 …