Skip to main content

Private Information Retrieval

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems
  • 210 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Beimel A, Ishai Y. Information-theoretic private information retrieval: a unified construction. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming; 2001. p. 912–26.

    Chapter  Google Scholar 

  2. Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication. In: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques; 1999. p. 402–14.

    Google Scholar 

  3. Chang Y. Single database private information retrieval with logarithmic communication. In: Proceedings of the 9th Australasian Conference on Information Security and Privacy; 2004. p. 50–61.

    Chapter  Google Scholar 

  4. Chor B, Goldreich O, Kushilevitz E, Sudan M. Private information retrieval. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science; 1995. p. 41–51.

    Google Scholar 

  5. Chor B, Kushilevitz E, Goldreich O, Sudan M. Private information retrieval. J ACM. 1998;45(6) L965–81.

    Article  MathSciNet  MATH  Google Scholar 

  6. Damgard I, Jurik M. A generalisation. A simplification and some applications of Paillier’s probabilistic public-key system. In: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography; 2001. p. 119–36.

    Chapter  Google Scholar 

  7. Devet C, Goldberg I, Heninger N. Optimally robust private information retrieval. In: Proceedings of the 12th USENIX Security Symposium; 2012. p. 13–13.

    Google Scholar 

  8. Gasarch, W. A survey on private information retrieval. Bull EATCS. 2004; 82:72–107.

    MathSciNet  MATH  Google Scholar 

  9. Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing; 2009. p. 169–78.

    Google Scholar 

  10. Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. In: Proceedings of the 30th Annual Conference on Advances in Cryptology; 2010. p. 116–37.

    Chapter  Google Scholar 

  11. Gentry C, Ramzan Z. Single database private information retrieval with constant communication rate. In: Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming; 2005. p. 803–15.

    Chapter  Google Scholar 

  12. Goldreich, O. and Levin, LA. A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing; 1989. p. 25–32.

    Google Scholar 

  13. Goldwasser S, Micali S. Probabilistic encryption. J Comput Syst Sci. 1984;28(2):270–99.

    Article  MathSciNet  MATH  Google Scholar 

  14. Kushilevitz E, Ostrovsky R. Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science; 1997. p. 364–73.

    Google Scholar 

  15. Kushilevitz E, Ostrovsky R. One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Proceedings of the 19th International Conference on Theory and Application of Cryptographic Techniques; 2000. p. 104–21.

    Chapter  Google Scholar 

  16. Lipmaa H. An oblivious transfer protocol with log-squared communication. In: Proceedings of the 8th Information Security Conference; 2005. p. 314–28.

    Google Scholar 

  17. Lipmaa H. First CPIR protocol with data-dependent computation. In: Proceedings of the 12th International Conference on Information Security and Cryptology; 2009 p. 193–210.

    Chapter  Google Scholar 

  18. Lliev A, Smith SW. Protecting client privacy with trusted computing at the server. IEEE Secur Priv. 2005;3(2):20–28.

    Article  Google Scholar 

  19. Naor M, Pinkas B. Oblivious transfer with adaptive queries. In: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology; 1999. p. 791–91.

    Chapter  Google Scholar 

  20. Naor M, Yung M. Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing; 1989. p. 33–43.

    Google Scholar 

  21. Ostrovsky R, Skeith WE III. Private searching on streaming data. In: Proceedings of the 25th Annual International Conference on Advances in Cryptology; 2005. p. 223–40.

    Chapter  Google Scholar 

  22. Ostovsky R, Skeith WE III. A survey of single-database PIR: Techniques and applications. In: Proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography; 2007. p. 393–411.

    Google Scholar 

  23. Ostrovsky R, Skeith WE III. Private searching on streaming data. J Cryptol. 2007;20(4):397–430.

    Article  MathSciNet  MATH  Google Scholar 

  24. Paillier P. Public key cryptosystems based on composite degree residue classes. In: Proceedings of the 17th International Conference on the Theory and Application of Cryptographic Techniques; 1999. p. 223–38.

    Google Scholar 

  25. Paulet R, Kaosar MG, Yi X, Bertino E. Privacy-preserving and content-protecting location based queries. In: Proceedings of the 28th International Conference on Data Engineering; 2012. p. 44–53.

    Google Scholar 

  26. Paulet R, Kaosar MG, Yi X, Bertino E. Privacy-preserving and content-protecting location based queries. IEEE transactions on knowledge and data engineering, 2014; 26(5):1200–10.

    Article  Google Scholar 

  27. Pohlig S, Hellman M. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans Inf Theory. 1978;24(1):106–10.

    Article  MathSciNet  MATH  Google Scholar 

  28. Sion R, Carbunar B. On the computational practicality of private information retrieval. In: Proceedings of the Network and Distributed Systems Security Symposium; 2007.

    Google Scholar 

  29. Wang S, Ding X, Deng RH, Bao F. Private information retrieval using trusted hardware. In: Proceedings of the 11th European Symposium on Research in Computer Security; 2006. p. 49–64.

    Chapter  Google Scholar 

  30. Yi X, Kaosar M, Paulet R, Bertino E. Single-database private information retrieval from fully homomorphic encryption. IEEE Trans Knowl Data Eng. 2013;25(5):1125–34.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xun Yi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Yi, X. (2018). Private Information Retrieval. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80752

Download citation

Publish with us

Policies and ethics