Abstract
Private information retrieval (PIR) enables a user to retrieve a specific data item from a database, replicated among one or more servers, while hiding from each server the identity of the retrieved item. This problem was suggested by Chor et al. [11], and since then efficient protocols with sub-linear communication were suggested. However, in all these protocols the servers’ computation for each retrieval is at least linear in the size of entire database, even if the user requires just one bit.
In this paper, we study the computational complexity of PIR. We show that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. To overcome this problem we propose the model of PIR with preprocessing: Before the execution of the protocol each server may compute and store polynomially-many information bits regarding the database; later on, this information should enable the servers to answer each query of the user with more efficient computation. We demonstrate that preprocessing can save work. In particular, we construct, for any constant k = 2, a k-server protocol with O(n1/(2k-1)) communication and O(n/ log2k-2 n) work, and for any constants k = 2 and ε > 0 a k-server protocol with O(n 1/k+ε) communication and work. We also prove some lower bounds on the work of the servers when they are only allowed to store a small number of extra bits. Finally, we present some alternative approaches to saving computation, by batching queries or by moving most of the computation to an off-line stage.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Aiello, S. Bhatt, R. Ostrovsky, and S. Rajagopalan. Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. In ICALP 2000.
A. Ambainis. Upper bound on the communication complexity of private information retrieval. In 24th ICALP, volume 1256 of LNCS, pages 401–407, 1997.
A. Ambainis and S. Lokam. Improved upper bounds on the simultaneous messages complexity of the generalized addressing function. In LATIN 2000.
L. Babai, P. Kimmel, and S. Lokam. Simultaneous messages vs. communication. In 12th STACS, volume 900 of LNCS, pages 361–372, 1995.
D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In 7th STACS, volume 415 of LNCS, pages 37–48. Springer-Verlag, 1990.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: Improvements and applications. J. of Cryptology, 10:17–36, 1997. Early version: Security with small communication overhead, CRYPTO’ 90.
A. Beimel and Y. Ishai. On private information retrieval and low-degree polynomials. Manuscript, 2000.
A. Beimel, Y. Ishai, E. Kushilevitz, and T. Malkin. One-way functions are essential for single-server private information retrieval. In 31th STOC, pages 89–98, 1999.
C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT’ 99, volume 1592 of LNCS, pages 402–414. Springer, 1999.
B. Chor and N. Gilboa. Computationally private information retrieval. In 29th STOC, pages 304–313, 1997.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In 36th FOCS, pages 41–51, 1995. Journal version: JACM, 45:965–981, 1998.
T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9:251–280, 1990.
G. Di-Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for database private information retrieval. In 17th PODC, pages 91–100, 1998.
G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In EUROCRYPT 2000, volume 1807 of LNCS, pages 122–138, 2000.
Y. Dodis. Space-Time Tradeoffs for Graph Properties. Master’s thesis, Massachusetts Institute of Technology, 1998.
Y. Gertner, S. Goldwasser, and T. Malkin. A random server model for private information retrieval. In RANDOM’ 98, 2nd Workshop on Randomization and Approximation Techniques in CS, vol. 1518 of LNCS, pages 200–217. 1998.
Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In 30th STOC, pages 151–160, 1998.
Y. Ishai and E. Kushilevitz. Improved upper bounds on information theoretic private information retrieval. In 31th STOC, pages 79–88, 1999.
E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In 38th FOCS, pages 364–373, 1997.
E. Kushilevitz and R. Ostrovsky. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In EUROCRYPT 2000, volume 1807 of LNCS, pages 104–121, 2000.
J. H. van Lint. Introduction to Coding Theory. Springer-Verlag, 1982.
T. Malkin. A Study of Secure Database Access and General Two-Party Computation. PhD thesis, MIT, 2000. http://theory.lcs.mit.edu/~cis/cis-theses.html.
E. Mann. Private access to distributed information. Master’s thesis, Technion-Israel Institute of Technology, Haifa, 1998.
R. Ostrovsky and V. Shoup. Private information storage. In 29th STOC, pages 294–303, 1997.
P. Pudlák and V. Rödl. Modified Ranks of Tensors and the Size of Circuits. In 25th STOC, pages 523–531, 1993.
J. P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol. In ASIACRYPT’ 98, volume 1514 of LNCS, pages 357–371. Springer, 1998.
A.C. Yao. Should tables be sorted? JACM, 28:615–628, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Ishai, Y., Malkin, T. (2000). Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. In: Bellare, M. (eds) Advances in Cryptology — CRYPTO 2000. CRYPTO 2000. Lecture Notes in Computer Science, vol 1880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44598-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-44598-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67907-3
Online ISBN: 978-3-540-44598-2
eBook Packages: Springer Book Archive