Secure Keyword Search and Data Sharing Mechanism for Cloud Computing

被引:134
作者
Ge, Chunpeng [1 ,2 ]
Susilo, Willy [3 ]
Liu, Zhe [1 ]
Xia, Jinyue [4 ]
Szalachowski, Pawel [5 ]
Fang Liming [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 210016, Peoples R China
[2] Univ Wollongong, Sch Comp & Informat Technol, Wollongong, NSW 2522, Australia
[3] Univ Wollongong, Sch Comp & Informat Technol, Inst Cybersecur & Cryptol, Wollongong, NSW 2522, Australia
[4] IBM Corp, Armonk, NY 10504 USA
[5] Singapore Univ Technol & Design, Singapore 487372, Singapore
基金
澳大利亚研究理事会;
关键词
Encryption; Keyword search; Cloud computing; Search problems; Data privacy; Cloud data sharing; searchable attribute-based encryption; attribute-based proxy re-encryption; keyword update; ATTRIBUTE-BASED ENCRYPTION; PUBLIC-KEY ENCRYPTION; PROXY RE-ENCRYPTION; SCHEME;
D O I
10.1109/TDSC.2020.2963978
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The emergence of cloud infrastructure has significantly reduced the costs of hardware and software resources in computing infrastructure. To ensure security, the data is usually encrypted before it's outsourced to the cloud. Unlike searching and sharing the plain data, it is challenging to search and share the data after encryption. Nevertheless, it is a critical task for the cloud service provider as the users expect the cloud to conduct a quick search and return the result without losing data confidentiality. To overcome these problems, we propose a ciphertext-policy attribute-based mechanism with keyword search and data sharing (CPAB-KSDS) for encrypted cloud data. The proposed solution not only supports attribute-based keyword search but also enables attribute-based data sharing at the same time, which is in contrast to the existing solutions that only support either one of two features. Additionally, the keyword in our scheme can be updated during the sharing phase without interacting with the PKG. In this article, we describe the notion of CPAB-KSDS as well as its security model. Besides, we propose a concrete scheme and prove that it is against chosen ciphertext attack and chosen keyword attack secure in the random oracle model. Finally, the proposed construction is demonstrated practical and efficient in the performance and property comparison.
引用
收藏
页码:2787 / 2800
页数:14
相关论文
共 40 条
[1]  
Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
[2]  
Beimel A., 1996, SECURE SCHEMES SECRE
[3]   Ciphertext-policy attribute-based encryption [J].
Bethencourt, John ;
Sahai, Amit ;
Waters, Brent .
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, :321-+
[4]  
Blaze M, 1998, LECT NOTES COMPUT SC, V1403, P127, DOI 10.1007/BFb0054122
[5]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[6]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[7]  
Emura K, 2009, LECT NOTES COMPUT SC, V5451, P13, DOI 10.1007/978-3-642-00843-6_2
[8]   Public key encryption with keyword search secure against keyword guessing attacks without random oracle [J].
Fang, Liming ;
Susilo, Willy ;
Ge, Chunpeng ;
Wang, Jiandong .
INFORMATION SCIENCES, 2013, 238 :221-241
[9]   Interactive conditional proxy re-encryption with fine grain policy [J].
Fang, Liming ;
Susilo, Willy ;
Ge, Chunpeng ;
Wang, Jiandong .
JOURNAL OF SYSTEMS AND SOFTWARE, 2011, 84 (12) :2293-2302
[10]   A CCA-secure key-policy attribute-based proxy re-encryption in the adaptive corruption model for dropbox data sharing system [J].
Ge, Chunpeng ;
Susilo, Willy ;
Fang, Liming ;
Wang, Jiandong ;
Shi, Yunqing .
DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (11) :2587-2603