Secure conjunctive keyword search over encrypted data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3089, Issue , 2004, Pages 31-45

  Golle, Philippe ^a   Staddon, Jessica ^a   Waters, Brent ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Searching on encrypted data

Indexed keywords

COSTS; CRYPTOGRAPHY; DIGITAL STORAGE; SEARCH ENGINES;

COMMUNICATION COST; CONJUNCTIVE QUERIES; DECISIONAL DIFFIE HELLMAN; ENCRYPTED DATA; SEARCH CRITERION; SEARCHING ON ENCRYPTED DATA; SECURITY MODEL; UNTRUSTED SERVER;

NETWORK SECURITY;

EID: 33745120364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24852-1_3     Document Type: Article

References (17)

1. D. Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic Number Theory Symposium, Lecture Notes in Computer Science, Vol. 1423, Springer-Verlag, pp. 48-63, 1998.
2. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. In SIAM J. of Computing, Vol. 32, No. 3, pp. 586-615, 2003.
3. D. Boneh, G. Di Crescenzo, R. Ostrovsky and G. Persiano. Searchable public key encryption. To appear in Adances in Cryptology - Eurocrypt '04. Cryptology ePrint Archive, Report 2003/195, September 2003. http://eprint.iacr. org/2003/195/
4. K. Bennett, C. Grothoff, T. Horozov and I. Patrascu. Efficient sharing of encrypted data. In proceedings of ACISP 2002.
5. C. Cachin, S. Micali and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Advances in Cryptology - Eurocrypt '99.
6. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private information retrieval. In proceedings of FOCS '95.
7. B. Chor, N. Gilboa and M. Naor. Private Information Retrieval by Keywords. Technical report, TR CS0917, Department of Computer Science, Technion, 1997
8. Y. Dodis. Efficient construction of (distributed) random functions. In proceedings of the Workshop on Public Key Cryptography (PKC), 2003.
9. E. Goh. Secure Indexes. In the Cryptology ePrint Archive, Report 2003/216, March 16, 2004. http://eprint.iacr.org/2003/216/
10. Google, Inc. The basics of Google search. http://www.google.com/help/ basics.html
11. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious RAMs. In J. ACM, pp.431-473, 1996.
12. S. Jarecki, P. Lincoln and V. Shmatikov. Negotiated privacy. In the International Symposium on Software Security, 2002.
13. A. Joux. The Weil and Tate pairings as building blocks for public key cryptosystems. In Proceedings Fifth Algorithmic Number Theory Symposium, 2002.
14. A. Joux and K. Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. In IACR ePrint Archive: http://eprint.iacr.org/2001/003/
15. D. Song, D. Wagner and A. Perrig. Practical Techniques for Searches on Encrypted Data. In Proc. of the 2000 IEEE Security and Privacy Symposium, May 2000.
16. V. Tô, R. Safavi-Naini and F. Zhang. New Traitor Tracing Schemes Using Bilinear Map. In 2003 ACM Workshop on Digital Rights Management (DRM 2003), October 27, 2003, The Wyndham City Center Washington DC, USA.
17. B. Waters, D. Balfanz, G. Durfee and D. Smetters. Building an Encrypted and Searchable Audit Log. In proceedings of NDSS 2004.