KSII Transactions on Internet and Information Systems (TIIS)

  • 제7권5호
  • /
  • Pages.1328-1342
  • /
  • 2013
  • /
  • 1976-7277(pISSN)
  • /
  • 1976-7277(eISSN)
한국인터넷정보학회 (Korean Society for Internet Information)
권호 표지
DOI QR코드

DOI QR Code

Symmetric Searchable Encryption with Efficient Conjunctive Keyword Search

  • Jho, Nam-Su (Electronics and Telecommunications Research Institute) ;
  • Hong, Dowon (Department of Applied Mathematics, Kongju National University)
  • 투고 : 2012.12.11
  • 심사 : 2013.05.06
  • 발행 : 2013.05.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

키워드

참고문헌

  1. R. Ostrovsky, "Efficient computation on oblivious RAMs," in Proc. of 22nd Annual ACM Symposium on Theory of Computing, pp.514-523, May 13-17, 1990.
  2. O. Goldreich and R. Ostrovsky, "Software protection and simulation on oblivious RAMs," Journal of the ACM, 43(3), pp.431-473, May, 1996. https://doi.org/10.1145/233551.233553
  3. D. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," in Proc. of IEEE Symposium on Security and Privacy 2000, pp. 44-55, May 14-17, 2000.
  4. E.-J. Goh, "Secure indexes," Cryptology ePrint Archive 2003/216, 2003.
  5. S. Bellovin and W. Cheswick, "Privacy-enhanced searches using encrypted Bloom filters," Cryptology ePrint Archive 2004/022, 2004.
  6. Y. Chang and M. Mitzenmacher, "Privacy preserving keyword searches on remote encrypted data," in Proc. of Applied Cryptography and Network Security Conference (ACNS), pp. 442-455 June 7-10, 2005.
  7. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, "Searchable symmetric encryption: Improved definitions and efficient constructions," in Proc. of ACM CCS 06, pp. 79-88, October 30 - November 3, 2006.
  8. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, "Public key encryption with keyword search," in Proc. of Eurocrypt 2004, pp. 506-522, May 2-6, 2004.
  9. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions," in Proc. of Crypto 2005, pp. 205-222, August 14-18, 2005.
  10. P. Golle, J. Staddon, and B. Waters, "Secure conjunctive keyword search over encrypted data," in Proc. Applied Cryptography and Network Security Conference (ACNS), pp. 31-45, June 8-11, 2004.
  11. L. Ballard, S. Kamara, and F. Monrose, "Achieving efficient conjunctive keyword searches over encrypted data," in Proc. of ICICS 2005, pp. 414-426, December 6-9, 2005.
  12. D. Boneh and B. Waters, "Conjunctive, subset, and range queries on encrypted data," in Proc. of TCC 2007, pp. 535-554, February 21-24, 2007.
  13. D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M. Rosu, and M. Steiner, "Highly-scalable searchable symmetric encryption with support for Boolean queries," IACR ePrint Cryptography Archive 2013/169, 2013.
  14. 1990 US census data, http://kdd.ics.uci.edu .

피인용 문헌

  1. A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption vol.14, pp.5, 2020, https://doi.org/10.3837/tiis.2020.05.022