TY - JOUR

T1 - Breaking the O(n1/(2k-1)) barrier for information-theoretic private information retrieval

AU - Beimel, Amos

AU - Ishai, Yuval

AU - Kushilevitz, Eyal

AU - Raymond, Jean François

N1 - Copyright:
Copyright 2004 Elsevier Science B.V., Amsterdam. All rights reserved.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of n bits of data. For any fixed k, the complexity of the best protocols prior to our work was O(n1/2k-1) (Ambainis, 1997). Since then several methods were developed in an attempt to beat this bound, but all these methods yielded the same asymptotic bound. In this work, this barrier is finally broken and the complexity of information-theoretic k-server PIR is improved to nO(log log k/k log k). The new PIR protocols can also be used to construct k-query binary locally decodable codes of length exp(nO(log log k/k log k)), compared to exp(n1/k-1) in previous constructions. The improvements presented in this paper apply even for small values of k: the PIR protocols are more efficient than previous ones for every k ≥ 3, and the locally decodable codes are shorter for every k ≥ 4.

AB - Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic, k-server PIR protocols the database is replicated among k servers, and each server learns nothing about the item the user retrieves. The cost of such protocols is measured by the communication complexity of retrieving one out of n bits of data. For any fixed k, the complexity of the best protocols prior to our work was O(n1/2k-1) (Ambainis, 1997). Since then several methods were developed in an attempt to beat this bound, but all these methods yielded the same asymptotic bound. In this work, this barrier is finally broken and the complexity of information-theoretic k-server PIR is improved to nO(log log k/k log k). The new PIR protocols can also be used to construct k-query binary locally decodable codes of length exp(nO(log log k/k log k)), compared to exp(n1/k-1) in previous constructions. The improvements presented in this paper apply even for small values of k: the PIR protocols are more efficient than previous ones for every k ≥ 3, and the locally decodable codes are shorter for every k ≥ 4.

UR - http://www.scopus.com/inward/record.url?scp=0036957230&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0036957230

SP - 261

EP - 270

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SN - 0272-5428

Y2 - 16 November 2002 through 19 November 2002

ER -