Keyword Search and Oblivious Pseudorandom Functions

  • Michael J. Freedman
  • Yuval Ishai
  • Benny Pinkas
  • Omer Reingold
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3378)

Abstract

We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are accessed according to their associated keywords and where we care for the privacy of both the client and the server. We provide efficient solutions for various settings of KS, based either on specific assumptions or on general primitives (mainly oblivious transfer). Our general solutions rely on a new connection between KS and the oblivious evaluation of pseudorandom functions (OPRFs). We therefore study both the definition and construction of OPRFs and, as a corollary, give improved constructions of OPRFs that may be of independent interest.

Keywords

Secure keyword search oblivious pseudorandom functions private information retrieval secure two-party protocols privacy-preserving protocols 

References

  1. 1.
    Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 119. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers’ computation in private information retrieval: Pir with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, p. 55. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Boneh, D., Di 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)CrossRefGoogle Scholar
  4. 4.
    Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 402. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143–202 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chang, Y.-C.: Single database private information retrieval with logarithmic communication. In: Proc.9th ACISP, Sydney, Australia, (July 2004)Google Scholar
  7. 7.
    Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Technical Report TR-CS0917, Dept. of Computer Science, Technion (1997)Google Scholar
  8. 8.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proc.36th FOCS, Milwaukee, WI, October 23-25 (1995)Google Scholar
  9. 9.
    Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637–647 (1985)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proc.30th ACM STOC, Dallas, TX (May 1998)Google Scholar
  12. 12.
    Gilboa, N.: Topics in Private Information Retrieval. PhD thesis, Technion - Israel Institute of Technology (2000)Google Scholar
  13. 13.
    Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)MATHCrossRefGoogle Scholar
  14. 14.
    Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(4), 792–807 (1986)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4), 1364–1396 (1999)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: Proc.30th FOCS, Research Triangle Park, NC, October–November (1989)Google Scholar
  17. 17.
    Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145–161. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  18. 18.
    Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proc. 36th ACM STOC, Chicago, IL (June 2004)Google Scholar
  19. 19.
    Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th ACM STOC, Chicago, IL (May 1988)Google Scholar
  20. 20.
    Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: Proc. 38th FOCS, Miami Beach, FL (October 1997)Google Scholar
  21. 21.
    Lipmaa, H.: An oblivious transfer protocol with log-squared communication. Crypto ePrint Archive, Report 2004/063 (2004)Google Scholar
  22. 22.
    Micali, S., Rabin, M., Kilian, J.: Zero-knowledge sets. In: Proc. 44th FOCS, Cambridge, MA (October 2003)Google Scholar
  23. 23.
    Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. 31st ACM STOC, Atlanta, GA (May 1999)Google Scholar
  24. 24.
    Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 573. Springer, Heidelberg (1999)Google Scholar
  25. 25.
    Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: Proc. 12th SIAM SODA, Washington, DC (January 2001)Google Scholar
  26. 26.
    Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: Proc. 38th FOCS, Miami Beach, FL (October 1997)Google Scholar
  27. 27.
    Ogata, W., Kurosawa, K.: Oblivious keyword search. Crypto ePrint Archive, Report 2002/182 (2002)Google Scholar
  28. 28.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)Google Scholar
  29. 29.
    Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)Google Scholar
  30. 30.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proc. IEEE Symposium on Security and Privacy, Berkeley, CA (May 2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michael J. Freedman
    • 1
  • Yuval Ishai
    • 2
  • Benny Pinkas
    • 3
  • Omer Reingold
    • 4
  1. 1.New York University 
  2. 2.Technion 
  3. 3.HP LabsIsrael
  4. 4.Weizmann Institute of Science 

Personalised recommendations