Information-Theoretic Error-Detecting Private Information Retrieval on Database of size n
1Communication ComplexityCorollary 4
Evaluation Results
| Method | Links | |
|---|---|---|
| Corollary 4l (number of servers)=d(t + 1), t (number of colluding servers)=t, Algebraic Structure=Rp, Privacy=Perfect, Verifiable=(t, 1/(p-1))2026.04 | 1 | |
| Corollary 1l (number of servers)=3, t (number of colluding servers)=1, Algebraic Structure=Rp, Privacy=Statistical, Verifiable=(1, 1/(p-1))2026.04 | 2 | |
| Corollary 1l (number of servers)=4, t (number of colluding servers)=1, Algebraic Structure=Rp, Privacy=Statistical, Verifiable=(1, 1/(p-1))2026.04 | 2 | |
| Corollary 2l (number of servers)=4, t (number of colluding servers)=1, Algebraic Structure=Rpτ, Privacy=Perfect, Verifiable=(1, 1/(pτ - pτ-1))2026.04 | 2 | |
| Corollary 3l (number of servers)=8, t (number of colluding servers)=1, Algebraic Structure=Rp, Privacy=Perfect, Verifiable=(1, 1/(p-1))2026.04 | 2 | |
| APIRl (number of servers)=3, t (number of colluding servers)=1, Algebraic Structure=Fp, Privacy=Statistical, Verifiable=(1, 1/(p-1))2026.04 | 2 | |
| APIRl (number of servers)=4, t (number of colluding servers)=1, Algebraic Structure=Fp, Privacy=Perfect, Verifiable=(1, 1/(p-1))2026.04 | 2 |