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.
Keywords
- Hash Function
- Security Parameter
- Homomorphic Encryption
- Oblivious Transfer
- Private Information Retrieval
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Chapter PDF
References
Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Boneh, D., Kushilevitzy, E., Ostrovsky, R., Skeith, W.: Public Key Encryption that Allows PIR Queries. IACR E-print archive (2007)
Brassard, G., Crepeau, C., Robert, J.-M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234–238. Springer, Heidelberg (1987)
Beimel, A., Ishai, Y., Kushilevitz, E., Malkin, T.: One-way functions are essential for single-server private information retrieval. In: Proc. of the 31th Annu. ACM Symp. on the Theory of Computing, ACM Press, New York (1999)
Crépeau, C.: Equivalence between two flavors of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–354. Springer, Heidelberg (1988)
Chang, Y.C.: Single Database Private Information Retrieval with Logarithmic Communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, Springer, Heidelberg (2004)
Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402–414. Springer, Heidelberg (1999)
Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proc. of the 36th Annu. IEEE Symp. on Foundations of Computer Science, pp. 41–51. IEEE, Los Alamitos (1995), (Journal version: J. of the ACM 45, 965–981, 1998)
Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM Conference on Computer and Communications Security, CCS 2006, pp. 79–88. ACM Press, New York (2006)
Damgård, I., Jurik, M.: A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, Springer, Heidelberg (2001)
DiCrescenzo, G., Ishai, Y., Ostrovsky, R.: Universal service-providers for database private information retrieval. In: Proc. of the 17th Annu. ACM Symp. on Principles of Distributed Computing, pp. 91–100. ACM Press, New York (1998), (Full version in Journal of Cryptology 14(1), 37-74, 2001)
Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single-database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 122–138. Springer, Heidelberg (2000)
Dziembowski, S., Maurer, U.: On Generating the Initial Key in the Bounded-Storage Model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126–137. Springer, Heidelberg (2004)
Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM 28, 637–647 (1985)
Gentry, C., Ramzan, Z.: Single Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803–815. Springer, Heidelberg (2005)
Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proc. of the 30th Annu. ACM Symp. on the Theory of Computing, pp. 151–160. ACM Press, New York (1998)
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comp. Sys. Sci 28(1), 270–299 (1984)
Goldreich, O., Ostrovsky, R.: Software Protection and Simulation on Oblivious RAMs. J. ACM 43(3), 431–473 (1996)
Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient Conditions for Collision-Resistant Hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 445–456. Springer, Heidelberg (2005)
Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: STOC 2004, pp. 262–271 (2004)
Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from Anonymity. In: FOCS 2006, pp. 239–248 (2006)
Harnik, D., Naor, M.: On the Compressibility of NP Instances and Cryptographic Applications. In: FOCS 2006, pp. 719–728 (2006)
Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: Proc. of the 38th Annu. IEEE Symp. on Foundations of Computer Science, pp. 364–373. IEEE Computer Society Press, Los Alamitos (1997)
Kushilevitz, E., Ostrovsky, R.: One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 104–121. Springer, Heidelberg (2000)
Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314–328. Springer, Heidelberg (2005)
Meier, R., Przydatek, B.: On Robust Combiners for Private Information Retrieval and Other Primitives. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 555–569. Springer, Heidelberg (2006)
Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. of the 31th Annu. ACM Symp. on the Theory of Computing, pp. 245–254. ACM Press, New York (1999)
Naor, M., Nissim, K.: Communication Complexity and Secure Function Evaluation Electronic Colloquium on Computational Complexity (ECCC) 8(062) (2001)
Naor, M., Yung, M.: Universal One-Way Hash Functions and their Cryptographic Applications. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 15–17, 1989, ACM, New York (1989)
Ostrovsky, R., Shoup, V.: Private information storage. In: Proc. of the 29th Annu. ACM Symp. on the Theory of Computing, pp. 294–303. ACM Press, New York (1997)
Ostrovsky, R., Skeith, W.: Private Searching on Streaming Data. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, Springer, Heidelberg (2005)
Ostrovsky, R., Skeith, W.: Algebraic Lower Bounds for Computing on Encrypted Data. In: ECCC, Electronic Colloquium on Computational Complexity,
Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. Presented at DIMACS Complexity and Cryptography workshop, October 1990, Princeton (1990), Prelim. version in: Proc. of the Sequences II workshop 1991, pp. 418-429. Springer-Verlag. Final version in: Cai, J.Y. (ed.) AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13 Distributed Computing and Cryptography, pp. 155-169. AMS, 1993.
Paillier, P.: Public Key Cryptosystems based on CompositeDegree Residue Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University (1981)
Tauman Kalai, Y., Raz, R.: Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. In: FOCS 2006, pp. 355–366 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ostrovsky, R., Skeith, W.E. (2007). A Survey of Single-Database Private Information Retrieval: Techniques and Applications. In: Okamoto, T., Wang, X. (eds) Public Key Cryptography – PKC 2007. PKC 2007. Lecture Notes in Computer Science, vol 4450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71677-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-71677-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71676-1
Online ISBN: 978-3-540-71677-8
eBook Packages: Computer ScienceComputer Science (R0)