9 problems

Let $M$ files be stored across $N$ servers, with each file stored independently using the same $(N,K)$-MDS code. A user wants to retrieve one file without revealing its index to an…

Let an $[n,k]$ MDS storage code store a database accessed by a Symmetric Private Information Retrieval scheme, with $t$-colluding servers, $b$ Byzantine servers, and $r$ unresponsi…

Let U-B-XS-MDS-TPIR denote the considered private information retrieval problem with its corresponding parameters, and let $C_\infty$ be its asymptotic capacity for a large number…

Let U-B-MDS-MB-XTSPIR denote the multi-user blind symmetric private information retrieval problem with coded servers, including the parameters governing the number of servers, codi…

Finite-file PIR rate conjecture. Any such PIR scheme has rate at most

Symmetric PIR capacity conjecture. The capacity of SPIR is

Asymptotic PIR capacity conjecture. The asymptotic capacity as the number of files $m$ tends to infinity is

Consider an $(N,M)$-MDS-coded database with $K\geq 2$ files and $T$-private symmetric private information retrieval, where any $T$ nodes may collude. For queries $Q_i^{[k]}$ and an…

Let an $(N,M)$-MDS-coded database store $K\geq 2$ files at $N$ nodes, where any $T$ nodes may collude. Let $T$-private symmetric private information retrieval (MDS-TSPIR) require u…