Reproduce “The Capacity of Private Information Retrieval from Coded Storage Systems with Colluding, Robust and Byzantine Servers” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Rui Sun, Yiwei Zhang
The authors characterize capacity for private information retrieval from coded storage with colluding, silent, and Byzantine servers. Their scheme matches query distributions across colluding servers and uses code structure to remove unwanted-file contributions and correct missing or false answers. Under stated conditions, its formula is capacity among linear, full support-rank schemes, and unrestricted when K=1 or T=1; an example achieves 4/9.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.