Reproduce “Functional Converses for Private Matrix-Product Retrieval under Library-Wide Decoder-Side Correlation” 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
Malihe Aliasgari, Yousef Nejatbakhsh
The paper studies private retrieval of a product of a rank-deficient state matrix and one of several correlated updates, while hiding the selected index. Its download lower bound depends on the product’s conditional entropy and colluding-PIR capacity. Public row-space structure permits matching compression; concealed structure has only a qualified lower bound. In a finite enumeration, selectors retain 1.830 bits, versus 2.457–2.740 for dense/XOR maps; this is not universal.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.