Abstract
In this paper we survey the notion of Single-Database Private Information Retrieval (PIR). The first Single-Database PIR was constructed in 1997 by Kushilevitz and Ostrovsky and since then Single-Database PIR has emerged as an important cryptographic primitive. For example, Single-Database PIR turned out to be intimately connected to collision-resistant hash functions, oblivious transfer and public-key encryptions with additional properties. In this survey, we give an overview of many of the constructions for Single-Database PIR (including an abstract construction based upon homomorphic encryption) and describe some of the connections of PIR to other primitives. © International Association for Cryptologic Research 2007.
Cite
CITATION STYLE
Ostrovsky, R., & Skeith, W. E. (2007). A survey of single-database private information retrieval: Techniques and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4450 LNCS, pp. 393–411). Springer Verlag. https://doi.org/10.1007/978-3-540-71677-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
