A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few ServersReportar como inadecuado




A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 GRACE - Geometry, arithmetic, algorithms, codes and encryption Inria Saclay - Ile de France 2 LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau 3 ENSTA ParisTech UMA - Unité de Mathématiques Appliquées 4 Alcatel-Lucent Bell Labs France Nozay

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.





Autor: Daniel Augot - Françoise Levy-Dit-Vehel - Abdullatif Shikfa -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados