Public key encryption with conjunctive keyword search and its extension to a multi-user system

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

Volumn 4575 LNCS, Issue , 2007, Pages 2-22

  Hwang, Yong Ho ^a   Lee, Pil Joong ^b  

^a Johns Hopkins University   (United States)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INDUSTRIAL ECONOMICS; ONLINE SEARCHING;

CIPHER TEXTS; COMMUNICATION OVERHEADS; DIFFIE-HELLMAN ASSUMPTIONS; EFFICIENT COMPUTATION; INTERNATIONAL CONFERENCES; KEYWORD SEARCHES; MULTI USERS; MULTI-USER SYSTEMS; NEW CONCEPT; OUT SOURCING; PAIRING-BASED CRYPTOGRAPHY; PRIVATE KEYS; PUBLIC KEY; PUBLIC-KEY ENCRYPTIONS; RANDOM ORACLE MODELS; SEARCHABLE ENCRYPTION; SECURITY PROOFS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 50049095455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_2     Document Type: Conference Paper

References (31)

1. Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., Shi, H.: Searhable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 205-222. Springer, Heidelberg (2005)
2. Baek, J., Safavi-Naini, R., Susilo, W.: Efficient Multi-receiver Identity-Based Encryption and Its Application to Broadcast Encryption. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 380-397. Springer, Heidelberg (2005)
3. Ballard, L., Green, M., De Medeiros, B., Monrose, F.: Correlation Resistant Storage. Technical Report TR-SP-BGMM-050507, Johns Hopkins University Department of Computer Science (2005)
4. Ballard, L., Kamara, S., Monrose, F.: Achieving Efficient Conjunctive Keyword Searches over Encrypted Data. In: Qing, S., Mao, W., Lopez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 414-426. Springer, Heidelberg (2004)
5. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithm for Pairing-based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-369. Springer, Heidelberg (2002)
6. Barreto, P.S.L.M., Lynn, B., Scott, M.: On The Selection of Pairing-friendly Groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17- 25. Springer, Heidelberg (2003)
7. Baudron, O., Pointcheval, D., Stern, J.: Extended Notions of Security for Multi-cast Public Key Cryptosystems. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 499-511. Springer, Heidelberg (2000)
8. Bellare, M., Boldyreva, A., Micali, S.: Public-key Encryption in a Multi-User Setting: Security Proofs and Improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259-274. Springer, Heidelberg (2000)
9. Bellare, M., Boldyreva, A., Staddon, J.: Randomness Re-use in Multi-recepient Encryption Schemes. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 85-99. Springer, Heidelberg (2003)
10. Boneh, D., Boyen, X., Shacham, H.: Short Group Signatrues. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
11. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keywrod Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004, LNCS, vol. 3027, pp. 506-522. Springer, Heidelberg (2004)
12. Boneh, D., Franklin, M.: Identity based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
13. Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325-342. Springer, Heidelberg (2005)
14. Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258-275. Springer, Heidelberg (2005)
15. Boneh, D., Shacham, H., Lynn, B.: Short Signatures from the Weil Pairing. Journal of Cryptology 17(4), 297-319 (2004) (Extended abstract in ASIACRYPT 2001, LNCS, vol. 2248, pp. 514-532, Springer, Heidelberg, 2001)
16. Boneh, D., Waters, B.: Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535 554. Springer, Heidelberg (2007)
17. Byun, J.W., Lee, D.H., Lim, J.: Efficient Conjunctive Keyword Searches on Encrypted Data Storage System. In: Atzeni, A.S., Lioy, A. (eds.) EuroPKI 2006. LNCS, vol. 4043, pp. 184-196. Springer, Heidelberg (2004)
18. Chang, Y.C., Mitzenmacher, M.: Privacy Preserving Keyword Searches on Remote Encrypted Data. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442 455. Springer, Heidelberg (2005)
19. Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In: ACM CCS 2006, pp. 79-88. ACM Press, New York (2007)
20. ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information on Information Theory 31, 469-472 (1985)
21. Goh, E.-J.: Secure indexes. Cryptology ePrint Archive, Report 2003/216 (2003)
22. Golle, P., Staddon, J., Waters, B.: Secure Conjunctive Keyword Search Over Encrypted Data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004, LNCS, vol. 3089, pp. 31 45. Springer, Heidelberg (2004)
23. Kiltz, E.: Chosen-Ciphertext Security from Tag-Based Encryption. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 581-600. Springer, Heidelberg (2006)
24. Kurosawa, K.: Multi-Recepient Public-Key Encryption with Shortend Ciphertext. In: Naccache, D., Paillier, P. (eels.) PKC 2002. LNCS, vol. 2274, pp. 48-63. Springer, Heidelberg (2002)
25. Lenstra, A., Verheul, E.R.: Selecting cryptographic key sizes. Journal of Cryptology 14(4), 255-293 (2001)
26. Park, D.J., Kim, K., Lee, P.J.: Public Key Encryption with Conjunctive Field Keyword Search, In: Lim, C.H., Yung, M. (eds.) WISA 2004, LNCS, vol. 3325, pp. 73-86. Springer, Heidelberg (2004)
27. Joux, A.: The Weil and Tate Pairing as Building Blocks for Public Key Cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory. LNCS, vol. 2369, pp. 20 32. Springer, Heidelberg (2002)
28. Miyaji, A., Nakabayashi, M., Takaute;no, S.: New Explicit Conditions of Elliptic Curve Traces for FR-Reduction. IEICE Trans. Fundamentals E84-A(5), 1234-1243 (2001)
29. Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612-613 (1979)
30. Song, D., Wagner, D., Perrig, A.: Practical Techniques for Searching on Encrypted Data. In: IEEE Symposium on Research in Security and Privacy 2000, pp. 44-55. IEEE Computer Society Press, Los Alamitos (2000)
31. Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building an Encrypted and Searchable Audit Log. In: NDSS 2004, The internet society (2004)