Breaking the O(n 1/(2k−1) ) Barrier for Information-Theoretic Private Information Retrieval (2002)
| Venue: | In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS |
| Citations: | 37 - 3 self |
BibTeX
@INPROCEEDINGS{Beimel02breakingthe,
author = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-françois Raymond},
title = {Breaking the O(n 1/(2k−1) ) Barrier for Information-Theoretic Private Information Retrieval},
booktitle = {In Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS},
year = {2002},
pages = {261--270}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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(n 1 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 log log k O( is improved to n k log k). The new PIR protocols can also be used to construct k-query binary locally log log k O( decodable codes of length exp(n k log k)), compared to exp(n 1 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. 1
Citations
No citations identified.
