Efficient Verifiable Multi-Key Searchable Encryption in Cloud Computing

被引:11
作者
Su, Yaping [1 ]
Wang, Jianfeng [1 ]
Wang, Yunling [1 ]
Miao, Meixia [2 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian 710126, Shaanxi, Peoples R China
[2] Xian Univ Posts & Telecommun, Natl Engn Lab Wireless Secur, Xian 710121, Shaanxi, Peoples R China
来源
IEEE ACCESS | 2019年 / 7卷
基金
中国国家自然科学基金;
关键词
Servers; Cloud computing; Encryption; Indexes; Keyword search; Searchable encryption; garbled bloom filter; verifiable search; KEYWORD SEARCH; DATABASE; SECURE; CHALLENGES; SCHEME;
D O I
10.1109/ACCESS.2019.2943971
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The notion of Multi-Key Searchable Encryption (MKSE) enables data owners to outsource their data into a cloud server, while supporting fine-grained data sharing with the authorized users. Note that the traditional MKSE is vulnerable to data leakage. That is, the malicious data owner may collude with the server and recover the search queries of authorized users. Recently, Hamlin et al. (PKC18) presented a new MKSE construction that can ensure data privacy between data owner and authorized users, where the share key is generated depending on data owner, authorized user and the specific document. However, their scheme cannot support verifiable search in the case of the malicious cloud server. In this paper, we propose a new verifiable MKSE (VMKSE) scheme by leveraging Garbled Bloom Filter, which can simultaneously support verifiability of search result and secure data sharing in multi-user setting. Compared to the state-of-the-art solution, the proposed scheme is superior in efficiency and verifiability. The experiment results demonstrate the efficiency of our scheme.
引用
收藏
页码:141352 / 141362
页数:11
相关论文
共 38 条
[1]   Database Management as a Service: Challenges and Opportunities [J].
Agrawal, Divyakant ;
El Abbadi, Amr ;
Emekci, Fatih ;
Metwally, Ahmed .
ICDE: 2009 IEEE 25TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2009, :1709-+
[2]  
[Anonymous], 2004, Internet mathematics, DOI DOI 10.1080/15427951.2004.10129096
[3]  
Asghar M.R., 2013, P ACM WORKSHOP CLOUD, P77
[4]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[5]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]   Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data [J].
Cao, Ning ;
Wang, Cong ;
Li, Ming ;
Ren, Kui ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (01) :222-233
[8]  
Cash D, 2013, LECT NOTES COMPUT SC, V8042, P353, DOI 10.1007/978-3-642-40041-4_20
[9]   New Algorithms for Secure Outsourcing of Modular Exponentiations [J].
Chen, Xiaofeng ;
Li, Jin ;
Ma, Jianfeng ;
Tang, Qiang ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (09) :2386-2396
[10]   Shared and searchable encrypted data for untrusted servers [J].
Dong, Changyu ;
Russello, Giovanni ;
Dulay, Naranker .
JOURNAL OF COMPUTER SECURITY, 2011, 19 (03) :367-397