Symmetric searchable encryption with efficient range query using multi-layered linked chains

作     者：Jho, Nam-Su Chang, Ku-Young Hong, Dowon Seo, Changho 

作者机构：ETRI Cryptog Res Team Daejeon South Korea Kong Ju Univ Dept Math Sci Gong Ju Chungcheongnam South Korea 

出 版 物：《JOURNAL OF SUPERCOMPUTING》 (超高速计算杂志)

年 卷 期：2016年第72卷第11期

页      面：4233-4246页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：ETRI RD program [15ZS1500] Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) - Ministry of Science, ICT and Future Planning [2011-0029927] 

主　　题：Searchable encryption Cloud security Data privacy Query on encrypted data Range query 

摘      要：Searchable encryption is an encryption system which provides confidentiality of stored documents and usability of document search at the same time. Remote cloud storage is the most typical application for searchable encryption. By applying searchable encryption, inside attacks can be prevented fundamentally. Designing searchable encryption which supports various queries-for example, range query, conjunctive keyword query, etc.-is also important for convenience. In this paper, we focus on range query problem. Up to now, only a few results have been proposed, in which the main functions are constructed using public key cryptosystems. Therefore, the amount of computations for encryption and search is large. Furthermore, search time depends on the size of the entire database. We propose a new searchable encryption protocol which is based on a symmetric key encryption and linked chain structure instead of public key-based techniques. The main contribution of the protocol is reducing the computation cost for search remarkably. In reality, the amount of computations depends on the number of documents that are matched to a query instead of the size of the entire database.