ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an [n,k][n,k] MDS storage code store a database accessed by a Symmetric Private Information Retrieval scheme, with tt-colluding servers, bb Byzantine servers, and rr unresponsive servers. Let MM denote the number of messages. Symmetric PIR capacity conjecture. The capacity is

n−r−(k+t+2b−1)n−r.\frac{n-r-(k+t+2b-1)}{n-r}.

Moreover, the symmetrization of the current scheme is capacity-achieving, and the minimum shared randomness entropy per round required among the servers to guarantee symmetry is k+t−1k+t-1 in qq-ary units. This conjecture concerns both the symmetric PIR capacity and the required shared randomness; the supplied text gives no resolution status.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.