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

被引：0

作者：

Augot, Daniel ^{[1
,2
]}

Levy-dit-Vehel, Francoise ^{[1
,2
,3
]}

Shikfa, Abdullatif ^{[4
]}

机构：

[1] INRIA, Paris, France

[2] Ecole Polytech, Lab Informat, Palaiseau, France

[3] ENSTA ParisTech U2IS, Paris, France

[4] Alcatel Lucent, Colombes, France

来源：

CRYPTOLOGY AND NETWORK SECURITY, CANS 2014 | 2014年 / 8813卷

关键词：

LOCALLY DECODABLE CODES;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000 [11], it is well-known that information theoretically secure private information retrieval schemes can be built using locally decodable codes [15]. In this paper, we construct a Byzantine robust PIR scheme using the multiplicity codes introduced by Kopparty et al. [12]. Our main contributions are on the one hand to avoid full replication 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.

引用

页码：222 / +

页数：3