Abstract
In this chapter we turn our attention to the second main subject of the book, namely, private information retrieval. Recall that private information retrieval schemes are cryptographic protocols designed to safeguard the privacy of database users by allowing clients to retrieve records from replicated databases while completely hiding the identity of the retrieved records from the database owners.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Oded Goldreich, Howard Karloff, Leonard Schulman, and Luca Trevisan. Lower bounds for locally decodable codes and private information retrieval. In 17th IEEE Computational Complexity Conference (CCC), pages 175–183, 2002.
Toshiya Itoh and Yasuhiro Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. IEICE Transactions on Information and Systems, pages 263–270, 2010.
Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In 32nd ACM Symposium on Theory of Computing (STOC), pages 80–86, 2000.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yekhanin, S. (2010). Private information retrieval. In: Locally Decodable Codes and Private Information Retrieval Schemes. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14358-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14358-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14357-1
Online ISBN: 978-3-642-14358-8
eBook Packages: Computer ScienceComputer Science (R0)