Expressive query over outsourced encrypted data

被引:20
作者
Yang, Yang [1 ,2 ,3 ]
Liu, Ximeng [1 ,2 ]
Deng, Robert [2 ]
机构
[1] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou, Fujian, Peoples R China
[2] Singapore Management Univ, Sch Informat Syst, Singapore, Singapore
[3] Fuzhou Univ, Key Lab Informat Secur Network Syst, Fuzhou 350116, Fujian, Peoples R China
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Query over encrypted data; Range search; Boolean search; Subset search; Multiple users; PUBLIC-KEY ENCRYPTION; KEYWORD GUESSING ATTACKS; RANGE QUERY; SECURE; SCHEME;
D O I
10.1016/j.ins.2018.02.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data security and privacy concerns in cloud storage services compel data owners to encrypt their sensitive data before outsourcing. Standard encryption systems, however, hinder users from issuing search queries on encrypted data. Though various systems for search over encrypted data have been proposed in the literature, existing systems use different encrypted index structures to conduct search on different search query patterns and hence are not compatible with each other. In this paper, we propose a query over encrypted data system which supports expressive search query patterns, such as single/conjunctive keyword query, range query, boolean query and mixed boolean query, all using a single encrypted index structure. To the best of our knowledge, the proposed system enables the most expressive query pattern search among all the existing solutions. In addition, the system allows data users to simultaneously query over encrypted documents from multiple data owners using one query trapdoor and supports flexible user authorization and revocation. We show that our system is secure and resists keyword guessing attack. We also conduct extensive experiments and demonstrate that the system is more efficient than other public key searchable encryption systems. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:33 / 53
页数:21
相关论文
共 33 条
[1]  
Barker E., NIST Special Publication, V800-90C
[2]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[3]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[4]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[5]  
Bresson E, 2003, LECT NOTES COMPUT SC, V2894, P37
[6]  
Byun JW, 2006, LECT NOTES COMPUT SC, V4165, P75
[7]  
Cash D, 2013, LECT NOTES COMPUT SC, V8042, P353, DOI 10.1007/978-3-642-40041-4_20
[8]  
Catalano D., 2014, IACR CRYPTOL
[9]   Dual-Server Public-Key Encryption With Keyword Search for Secure Cloud Storage [J].
Chen, Rongmao ;
Mu, Yi ;
Yang, Guomin ;
Guo, Fuchun ;
Wang, Xiaofen .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (04) :789-798
[10]   A Forensically Sound Adversary Model for Mobile Devices [J].
Do, Quang ;
Martini, Ben ;
Choo, Kim-Kwang Raymond .
PLOS ONE, 2015, 10 (09)