Achieving efficient conjunctive keyword searches over encrypted data

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

Volumn 3783 LNCS, Issue , 2005, Pages 414-426

  Ballard, Lucas ^a   Kamara, Seny ^a   Monrose, Fabian ^a  

^a Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; MATHEMATICAL MODELS; SECURITY OF DATA;

CONJUNCTIVE KEYWORD SEARCHES; SHAMIR SECRET SHARING; SYMMETRICALLY ENCRYPTED DATA;

CRYPTOGRAPHY;

EID: 33646736337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602897_35     Document Type: Conference Paper

References (29)

1. G. Ateniese, J. Camenisch, and B. de Medeiros. Untraceable rfid tags via insubvertible encryption. In 12th ACM Conference on Computer and Communications Security (CCS 2005), 2005.
2. L. Ballard, M. Green, B. de Medeiros, and F. Monrose. Correlation resistant storage. Technical Report TR-SP-BGMM-050507, Johns Hopkins University Department of Computer Science, 2005.
3. L. Ballard, S. Kamara, and F. Monrose. Achieving efficient conjunctive keyword searches over encrypted data. Technical Report TR-SP-BKM-050920, Johns Hopkins University Department of Computer Science, 2005.
4. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 354-369. Springer-Verlag, 2002.
5. P. Barreto, B. Lynn, and M. Scott. On the selection of pairing-friendly groups. In Selected Areas in Cryptography -SAC '03, volume 3006 of Lecture Notes in Computer Science, pages 17-25. Springer-Verlag, 2004.
6. M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology - CRYPTO 1996, volume 1109 of Lecture Notes in Computer Science, pages 1-15. Springer, 1996.
7. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
8. D. Boneh. The Decision-Diffie Hellman Problem. In Third International Symposium on Algorithmic Number Theory (ANTS-III), volume 1423 of Lecture Notes in Computer Science, pages 48-63. Springer-Verlag, 1998.
9. D. Boneh, X. Boyen, and H. Sacham. Short group signatures. In Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer-Verlag, 2004.
10. D. Boneh, G. di Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Advances in Cryptology - Eurocrypt 2004, volume 3027 of Lecture Notes in Computer Science, pages 506-522. Springer-Verlag, 2004.
11. Jan Camenisch, Susan Hohenberger, and Anna Lysyanskaya. Compact e-cash. In Advances in Cryptology - EUROCRYPT 2005, Lecture Notes in Computer Science, pages 302-321. Springer, 2005.
12. Y. Chang and M. Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. In Third International Conference on Applied Cryptography and Network Security (ACNS 2005), volume 3531 of Lecture Notes in Computer Science, pages 442-455. Springer-Verlag, 2005.
13. I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: a distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, volume 2009 of Lecture Notes in Computer Science, pages 46-66, 2001.
14. Microsoft Corp. Federated, available and reliable storage for an incompletely trusted environment (Farsite). See http://research.microsoft.com/ sn/Farsite/.
15. D. Davis, F. Monrose, and M. Reiter. Time-scoped searching of encrypted audit logs. In 6th International Conference on Information and Communications Security (ICICS 2004), volume 3269 of Lecture Notes in Computer Science, pages 532-545. Springer-Verlag, 2004.
16. Federal Information Processing Standards. Advanced Encryption Standard (AES) FIPS 197, November 2001.
17. E-J. Goh. Secure indexes. Technical Report 2003/216, IACR ePrint Cryptography Archive, 2003. See http://eprint.iacr.org/2003/216.
18. P. Golle, J. Staddon, and B. Waters. Secure conjunctive keyword search over encrypted data. In Applied Cryptography and Network Security Conference (ACNS), volume 3089 of Lecture Notes in Computer Science, pages 31-45. Springer, 2004.
19. B. Jansen, A. Spink, J. Bateman, and T. Saracevic. Real life information retrieval: a study of user queries on the web. SIGIR Forum, 32(1):5-17, 1998.
20. D. Knuth. The Art of Computer Programming, volume 2. Addison-Wesley, Reading, Mass., 2nd edition, 1981.
21. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, C. Wells, and B. Zhao. Oceanstore: an architecture for global-scale persistent storage. In Ninth international conference on Architectural support for programming languages and operating systems, pages 190-201. ACM Press, 2000.
22. A. Lenstra and E. Verheul. Selecting cryptographic key sizes. In 3rd International Workshop on Practice and Theory in Public Key Cryptography (PKC 2000), volume 1751 of Lecture Notes in Computer Science, pages 446-465. Springer-Verlag, 2000.
23. The OpenSSL Library. See http://www.openssl.org.
24. Shamus Software Ltd. Multiprecision integer and rational arithmetic C/C++ library (MIRACL). See http://indigo.ie/~mscott.
25. D. Park, K. Kim, and P. Lee. Public key encryption with conjunctive field keyword search. In 5th International Workshop on Information Security Applications (WISA 2004), volume 3325 of Lecture Notes in Computer Science, pages 73-86. Springer-Verlag, 2004.
26. M. Scott. Authenticated ID-based key exchange and remote log-in with simple to ken and PIN number. Technical Report 2002/164, International Association for Cryptological Research, 2002. Available at http://eprint.iacr. org/2002/164.
27. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, November 1979.
28. D. Song, D. Wagner, and A. Perrig. Practical techniques for searching on encrypted data. In IEEE Symposium on Research in Security and Privacy, pages 44-55. IEEE Computer Society, May 2000.
29. B. Waters, D. Balfanz, G. Durfee, and D. Smetters. Building an encrypted and searchable audit log. In Network and Distributed System Security Symposium (NDSS 2004). The Internet Society, 2004.