Skip to main content
SpringerLink
Log in

Upper bound on the communication complexity of private information retrieval

  • Session 9: Algorithms II
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

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

Included in the following conference series:

Abstract

We construct a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1)).

Computer Science Division, University of California at Berkeley.

The author was supported by Latvia Science Council Grant 96.0282 and scholarship “SWH Izglītībai, Zinātnei un Kultūrai” from Latvia Education Foundation

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, J. Feigenbaum and J. Kilian, On hiding information from an oracle, Journal of Computer and System Sciences, 39(1989), pp. 21–50

    Google Scholar 

  2. N. Adam and J. Wortmann, Security control methods for statistical databases: a comparative study, ACM Somputing Surveys, 21(1989), pp. 515–555

    Article  Google Scholar 

  3. A. Ambainis, Upper bounds on multiparty communication complexity of shifts, Proceedings of STACS'96, Lecture Notes in Computer Science, vol. 1047(1996), pp. 631–642

    Google Scholar 

  4. L. Babai, P. Kimmel, S.V. Lokam, Simultaneous messages versus communication Proceedings of STACS'95, Lecture Notes in Computer Science, vol. 900(1995), pp. 361–372

    Google Scholar 

  5. R. Beaver, J. Feigenbaum, Hiding instances in multioracle queries, Proceedings of STACS'90, Lecture Notes in Computer Science, vol. 415(1990), pp. 37–48

    Google Scholar 

  6. R. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway, Security with low communication overhead, Crypto'90

    Google Scholar 

  7. B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan, Private information retrieval, Proceedings of FOCS'95, pp. 41–50. To appear in the Journal of the ACM.

    Google Scholar 

  8. D. Denning, Cryptography and Data Security, Addison-Wesley, 1982

    Google Scholar 

  9. R. Ostrovsky, V. Shoup, Private information storage, to appear in STOC'97.

    Google Scholar 

  10. P. Pudlak, V. Rödl, Modified ranks of tensors and the size of circuits, Proceedings of 25-th ACM STOC, 1993, pp. 523–531. Preliminary version of [11].

    Google Scholar 

  11. P. Pudlak, V. Rödl, J. Sgall, Boolean circuits, ranks of tensors and communication complexity, to appear in SIAM J. Computing.

    Google Scholar 

  12. J. D. Ullman, Principles of Database Systems. 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia

    Andris Ambainis

Authors
  1. Andris Ambainis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambainis, A. (1997). Upper bound on the communication complexity of private information retrieval. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_196

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_196

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation