Name
Abstract | ||
|---|---|---|
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k replicated databases. The scheme is information-theoretic secure for coalitions of databases of size t≤k-1. It improves the communication complexity of the scheme described in [Ishai and Kushilevitz (1999) Proc 31st Annu ACM Symp Theory Comput pp 79---88] for coalitions of size $$\\tfrac{k}{2} \\leqslant t \\leqslant k - 1$$. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/s102070100005 | Int. J. Inf. Sec. |
Keywords | Field | DocType |
protocols,privacy,unconditional security,key words: privacy --- protocols --- unconditional security,information theoretic security,communication complexity,private information retrieval,information retrieval | Information retrieval,Computer science,Communication complexity,Theoretical computer science,Private information retrieval,Database | Journal |
Volume | Issue | ISSN |
1 | 1 | 1615-5262 |
Citations | PageRank | References |
2 | 0.40 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlo Blundo | 1 | 1901 | 229.50 |
| Paolo D’Arco | 2 | 88 | 6.04 |
| Alfredo De Santis | 3 | 4049 | 501.27 |