Skip to main content
SpringerLink
Log in

Information-Theoretic Private Information Retrieval: A Unified Construction

Extended Abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

Abstract

A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved. In a t-private, k-server PIR protocol the database is replicated among k servers, and the user’s privacy is protected from any collusion of up to t servers. The main cost-measure of such protocols is the communication complexity of retrieving a single bit of data.

This work addresses the information-theoretic setting for PIR, in which the user’s privacy should be unconditionally protected from collusions of servers. We present a unified general construction, whose abstract components can be instantiated to yield both old and new families of PIR protocols. A main ingredient in the new protocols is a generalization of a solution by Babai, Kimmel, and Lokam to a communication complexity problem in the so-called simultaneous messages model.

Our construction strictly improves upon previous constructions and resolves some previous anomalies. In particular, we obtain: (1) t-private k-server PIR protocols with O(n 1/⌊ (2k-1)/tc⌋) communication bits, where n is the database size. For t > 1, this is a substantial asymptotic improvement over the previous state of the art; (2) a constant-factor improvement in the communication complexity of 1-private PIR, providing the first improvement to the 2-server case since PIR protocols were introduced; (3) efficient PIR protocols with logarithmic query length. The latter protocols have applications to the construction of efficient families of locally decodable codes over large alphabets and to PIR protocols with reduced work by the servers.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Ambainis. Upper bound on the communication complexity of private information retrieval. In Proc. of the 24th ICALP, vol. 1256 of LNCS, pp. 401–407. 1997.

    Google Scholar 

  2. A. Ambainis and S. Lokam. Improved upper bounds on the simultaneous messages complexity of the generalized addressing function. In LATIN 2000, vol. 1776 of LNCS, pp. 207–216. 2000.

    Chapter  Google Scholar 

  3. L. Babai, P. G. Kimmel, and S. V. Lokam. Simultaneous messages vs. communication. In 12th STOC, vol. 900 of LNCS, pp. 361–372. 1995.

    Google Scholar 

  4. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In STACS’ 90, vol. 415 of LNCS, pp. 37–48. 1990.

    Google Scholar 

  5. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: Improvements and applications. J. of Cryptology, 10(1):17–36. 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Beimel and Y. Ishai. Information-Theoretic Private Information Retrieval: A Unified Construction. TR01-15, Electronic Colloquium on Computational Complexity. 2001.

    Google Scholar 

  7. A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers’ computation in private information retrieval: PIR with preprocessing. In CRYPTO 2000, vol. 1880 of LNCS, pp. 56–74. 2000.

    Chapter  Google Scholar 

  8. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In CRYPTO’ 88, vol. 403 of LNCS, pp. 27–35. 1990.

    Google Scholar 

  9. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT’ 99, vol. 1592 of LNCS, 402–414. 1999.

    Google Scholar 

  10. B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of the 29th STOC, pp. 304–313. 1997.

    Google Scholar 

  11. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. J. of the ACM, 45:965–981. 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Di-Crescenzo, Y. Ishai, and R. Ostrovsky. Universal service-providers for private information retrieval. J. of Cryptology, 14(1):37–74. 2001.

    Article  MATH  MathSciNet  Google Scholar 

  13. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. JCSS, 60(3):592–629. 2000.

    MATH  MathSciNet  Google Scholar 

  14. O. Goldreich and L. Trevisan. On the length of linear error-correcting codes having a 2-query local decoding procedure. Manuscript, 2000.

    Google Scholar 

  15. Y. Ishai and E. Kushilevitz. Improved upper bounds on information theoretic private information retrieval. In Proc. of the 31th STOC, pp. 79–88. 1999.

    Google Scholar 

  16. M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. of Globecom 87, pp. 99–102. 1987.

    Google Scholar 

  17. H. Karloff and L. Schulman. Manuscript, 2000.

    Google Scholar 

  18. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. of the 32th STOC, pp. 80–86. 2000.

    Google Scholar 

  19. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. of the 38th FOCS, pp. 364–373. 1997.

    Google Scholar 

  20. E. Mann. Private access to distributed information. Master’s thesis, Technion-Israel Institute of Technology, Haifa, 1998.

    Google Scholar 

  21. A. Shamir. How to share a secret. CACM, 22:612–613. 1979.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ben-Gurion University, Israel

    Amos Beimel

  2. DIMACS and AT&T Labs — Research, USA

    Yuval Ishai

Authors
  1. Amos Beimel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuval Ishai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, C/Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  2. Computer Technology Institute (CTI), University of Patras, 61 Riga Feraiou street, 26221, Patras, Greece

    Paul G. Spirakis

  3. Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beimel, A., Ishai, Y. (2001). Information-Theoretic Private Information Retrieval: A Unified Construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation