Keyword search and oblivious pseudorandom functions

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 303-324

  Freedman, Michael J ^a   Ishai, Yuval ^b   Pinkas, Benny ^c   Reingold, Omer ^d  

^a NEW YORK UNIVERSITY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HEWLETT PACKARD LABORATORIES   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Oblivious pseudorandom functions; Privacy preserving protocols; Private information retrieval; Secure keyword search; Secure two party protocols

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; DATABASE SYSTEMS; FUNCTIONS; INFORMATION RETRIEVAL; NETWORK PROTOCOLS;

OBLIVIOUS EVALUATION OF PSEUDORANDOM FUNCTION (OPRF); PRIVACY-PRESERVING PROTOCOLS; PRIVATE INFORMATION RETRIEVAL; SECURE KEYWORD SEARCH; SECURE TWO-PARTY PROTOCOLS;

DATA PRIVACY;

EID: 24144488603     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_17     Document Type: Conference Paper

References (30)

1. Bill Aiello, Yuval Ishai, and Omer Reingold. Priced oblivious transfer: How to sell digital goods. In EUROCRYPT, Innsbruck, Austria, May 2001.
2. Amos Beimel, Yuval Ishai, and Tal Malkin. Reducing the servers' computation in private information retrieval: Pir with preprocessing. In CRYPTO, Santa Barbara, CA, August 2000.
3. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Public key encryption with keyword search. In EUROCRYPT, Interlaken, Switzerland, May 2004.
4. Christian Cachin, Silvio Micali, and Markus Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT, Prague, Czech Republic, May 1999.
5. Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
6. Yan-Cheng Chang. Single database private information retrieval with logarithmic communication. In Proc. 9th ACISP, Sydney, Australia, July 2004.
7. Benny Chor, Niv Gilboa, and Moni Naor. Private information retrieval by keywords. Technical Report TR-CS0917, Dept. of Computer Science, Technion, 1997.
8. Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. In Proc. 36th FOCS, Milwaukee, WI, 23-25 October 1995.
9. Shimon Even, Oded Goldreich, and Abraham Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
10. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. Efficient private matching and set intersection. In EUROCRYPT, Interlaken, Switzerland, May 2004.
11. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting data privacy in private information retrieval schemes. In Proc. 30th ACM STOC, Dallas, TX, May 1998.
12. Niv Gilboa. Topics in Private Information Retrieval. PhD thesis, Technion - Israel Institute of Technology, 2000.
13. Oded Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
14. Oded Goldreich, Shaft Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, October 1986.
15. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, 1999.
16. Russell Impagliazzo and Michael Luby. One-way functions are essential for complexity based cryptography. In Proc. 30th FOCS, Research Triangle Park, NC, October-November 1989.
17. Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. Extending oblivious transfers efficiently. In CRYPTO, Santa Barbara, CA, August 2003.
18. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Batch codes and their applications. In Proc. 36th ACM STOC, Chicago, IL, June 2004.
19. Joe Kilian. Founding cryptography on oblivious transfer. In Proc. 20th ACM STOC, Chicago, IL, May 1988.
20. Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. 38th FOCS, Miami Beach, FL, October 1997.
21. Helger Lipmaa. An oblivious transfer protocol with log-squared communication. Crypto ePrint Archive, Report 2004/063, 2004.
22. Silvio Micali, Michael Rabin, and Joe Kilian. Zero-knowledge sets. In Proc. 44th FOCS, Cambridge, MA, October 2003.
23. Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st ACM STOC, Atlanta, GA, May 1999.
24. Moni Naor and Benny Pinkas. Oblivious transfer with adaptive queries. In CRYPTO, Santa Barbara, CA, August 1999.
25. Moni Naor and Benny Pinkas. Efficient oblivious transfer protocols. In Proc. 12th SIAM SODA, Washington, DC, January 2001.
26. Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudorandom functions. In Proc. 38th FOCS, Miami Beach, FL, October 1997.
27. Wakaha Ogata and Kaoru Kurosawa. Oblivious keyword search. Crypto ePrint Archive, Report 2002/182, 2002.
28. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, Prague, Czech Republic, May 1999.
29. Michael O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
30. Dawn Xiaodong Song, David Wagner, and Adrian Perrig. Practical techniques for searches on encrypted data. In Proc. IEEE Symposium on Security and Privacy, Berkeley, CA, May 2000.