Browse > Article

A Design of Efficient Keyword Search Protocol Over Encrypted Document  

Byun, Jin-Wook (Department of Information and Communication, Pyeongtaek University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea CI / v.46, no.1, 2009 , pp. 46-55 More about this Journal
Abstract
We study the problem of searching documents containing each of several keywords (conjunctive keyword search) over encrypted documents. A conjunctive keyword search protocol consists of three entities: a data supplier, a storage system such as database, and a user of storage system. A data supplier uploads encrypted documents on a storage system, and then a user of the storage system searches documents containing each of several keywords. Recently, many schemes on conjunctive keyword search have been suggested in various settings. However, the schemes require high computation cost for the data supplier or user storage. Moreover, up to now, their securities have been proved in the random oracle model. In this paper, we propose efficient conjunctive keyword search schemes over encrypted documents, for which security is proved without using random oracles. The storage of a user and the computational and communication costs of a data supplier in the proposed schemes are constant. The security of the scheme relies only on the hardness of the Decisional Bilinear Diffie-Hellman (DBDH) problem.
Keywords
자료 검색 및 저장;암호화문서 검색;데이터베이스 보안;프라이버시 보호;개인정보보호기술;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. W. Byun, D. H. Lee, and J. Lim, 'Efficient Conjuctive Keyword Search on Encrypted Data Storage System', In Proceedings of EuroPKI'06, LNCS Vol. 4043, pp. 184-196, 2006
2 G. Di. Crescenzo, T. Malkin, and R. Ostrovsky, 'Single-database private information retrieval implies oblivious transfer', In Proceedings of Eurocrypt'00, LNCS Vol. 1807, pp. 122-139, Springer-Verlag, 2000   DOI   ScienceOn
3 S. Goldwasser and M. Bellare, Lecture notes on cryptography', page 155, 2001. Available at http://www-cse.ucsd.edu/users/mihir/courses.html
4 A. Gordon, M. P. Loeb, W. Lucyshyn, and R. Richardson, '2004 CSI/FBI Computer Crime and Security Survey', Ninth annual report of computer security society, CSI, 2004. For general information, refer to 'http://gocsi.com or http://www.nipc.gov
5 W. Ogata and K. Kurosawa, 'Oblivious keyword search' Journal of Complexity, Vol. 20, Issues 2-3, pp. 356-371, 2004   DOI   ScienceOn
6 B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, 'Private Information Retrieval', In Proceedings of 29th STOC, 1997
7 M. Scott and P. S. L. M. Barreto, 'Compressed pairing', In Proceedings of Crypto'04, LNCS Vol. 3152, pp. 140-156, Springer-Verlag, 2004   DOI   ScienceOn
8 C. Cachin, S. Micali, and M. Stadler, 'Computationally Private Information Retrieval', In Proceedings of Eurocrypt'99, LNCS Vol. 1403, pp. 361-374, 1998
9 M. Naor and M. Yung. 'Universal One-way Hash Functions and Their Cryptographic Applications', In Proceedings of the 21st ACM Symposium on Theory of Computing, pp 33-43, ACM Press, 1989
10 E. Goh, 'Secure Indexes', In Cryptology ePrint Archieve on March 16, 2004, Availabe at http://eprint.iacr.org/2003/216
11 G. Di. Crescenzo, Y. Ishai, and R. Ostrovsky, 'Universal Service-providers for Database Private Information Retrieval', In Proceedings of 17th PODC, 1998   DOI
12 B. Bloom, 'Space/time trade-offs in hash coding with allowable errors', Communications of the ACM, 13(7):422-426, 1970   DOI
13 P. Golle, J. Staddon, and B. Waters, 'Secure Conjunctive Keyword Search Over Encrypted Data', In Proceedings of ACNS'04, LNCS Vol. 3089, pp. 31-45, Springer-Verlag, 2004   DOI   ScienceOn
14 D. Boneh and M. Franklin, 'Identity-Based Encryption from the Weil Pairing', SIAM J. of Computing, Vol. 32, No. 3, pp. 586-615, 2003   DOI   ScienceOn
15 M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, 'Encryption with keyword search, revisited: consistency conditions, relations to anonymous IBE, and extensions' In Proceedings of Crypto'05, LNCS Vol. 3621, pp. 205-222, Springer-Verlag, 2005
16 V.Shoup, 'Sequences of games: a tool for taming complexity in security proofs', Cryptology ePrint Archive, Report 2004/332, 2004
17 D. J. Park, K. Kim, and P. J. Lee, 'Public Key Encryption with Conjunctive Field Keyword Search', In Proceedings of WISA'04, LNCS Vol. 3325, pp. 73-86, Springer-Verlag, 2004   DOI   ScienceOn
18 V. D. R. Safavi-Naini, and, F. Zhang, 'New traitor tracing schemes using bilinear map', In 2003 ACM Workshop on Digital Rights Management (DRM 2003), 2003
19 Y. Chang and M. Mitzenmacher, 'Privacy preserving keyword searches on remote encrypted data”' In Proceedings of ACNS`05, LNCS Vol. 3531, pp. 442-445, Springer-Verlag, 2005   DOI   ScienceOn
20 Microsoft Developer Network (MSDN), in the part of Maximum Capacity Specifications for SQL Server 2005. Refer to http://msdn2.microsoft.com/en us/library/ms143432(SQL.90).aspx
21 D. Boneh and B. Waters, 'Conjunctive, Subset, and Range Queries on Encrypted Data', In Proceedings of TCC'07, LNCS Vol. 4392, pp. 535-554, 2007   DOI   ScienceOn
22 R. Ostrovsky and W. Skeith, 'Private keyword search on streaming data', This paper is availabe at http://eprint.iacr.org/2005/242
23 D. Song, D. Wagner, and A. Perrig, 'Practical Techniques for Searches on Encrypted Data', In Proceedings of IEEE sysmposium on Security and Privacy, 2000
24 D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, 'Public Key Encryption with Keyword Search', In Proceedings of Eurocrypt'04, LNCS Vol. 3089, pp. 31-45, Springer-Verlag, 2004