A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers

Abstract

Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval schemes can be built using locally decodable codes. In this paper, we construct a Byzantine ro-bust PIR scheme using the multiplicity codes introduced by Kopparty et al. Our main contributions are on the one hand to avoid full replica-tion of the database on each server; this significantly reduces the global redundancy. On the other hand, to have a much lower locality in the PIR context than in the LDC context. This shows that there exists two different notions: LDC-locality and PIR-locality. This is made possible by exploiting geometric properties of multiplicity codes.
Fichier principal
Vignette du fichier
cans-final.pdf (539.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01094807 , version 1 (13-12-2014)

Identifiers

Cite

Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa. A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. 13th International Conference, Cryptology and Network Security (CANS), Oct 2014, Heraklion, Greece. pp.222 - 239, ⟨10.1007/978-3-319-12280-9_15⟩. ⟨hal-01094807⟩
641 View
188 Download

Altmetric

Share

Gmail Facebook X LinkedIn More