Blockchain-enabled multi-authorization and multi-cloud attribute-based keyword search over encrypted data in the cloud

被引:24
作者
Wu, Qing [1 ]
Lai, Taotao [1 ]
Zhang, Leyou [2 ]
Mu, Yi [3 ]
Rezaeibagha, Fatemeh [4 ]
机构
[1] Xian Univ Posts & Telecommun, Sch Automat, Xi'an 710121, Peoples R China
[2] Xidian Univ, Sch Math & Stat, Xian 710071, Peoples R China
[3] City Univ Macau, Inst Data Sci, Macau, Peoples R China
[4] Murdoch Univ, Discipline Informat Technol Math & Stat, Perth, Australia
基金
中国国家自然科学基金;
关键词
Searchable encryption; Multi-authority; Multi-cloud; Privacy protection; Consortium blockchain; ACCESS-CONTROL SCHEME; AUTHORITY; EFFICIENT;
D O I
10.1016/j.sysarc.2022.102569
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With the arrival of the 5G era, fast and secure data sharing is attracting increased attention. Among of the presented solutions, keyword search plays an important role since it can identify users and search ciphertext without decryption. However, the existing searchable algorithms have many limitations, such as powerful central authority, match processes being only carried out on the cloud server, and center corruption and single point of failure being easy to cause. Presently, the fairness of the keyword search is still a challenge. To solve these problems, we present a multi-authority and multi-cloud keyword search scheme based on the consortium blockchain and attribute-based encryption. Under this framework, multi-cloud block storage technique is used to address the unreliability of cloud servers, where at least two ciphertext files are stored in blocks on multiple cloud servers. It can resist malicious leaks, ciphertext tampering, and deletion of ciphertext by cloud servers. Blockchain allows the proposed scheme to achieve the integrity and correctness of the encrypted data, which also solves the fairness of search results. Furthermore, the scheme realizes privacy protection by hiding the keyword and the access policy in the trapdoor matching process. Finally, the security analyses and performance comparisons show the advantages of the proposed scheme over the existing work.
引用
收藏
页数:12
相关论文
共 44 条
[31]   KS-ABESwET: A Keyword Searchable Attribute-Based Encryption Scheme With Equality Test in the Internet of Things [J].
Wang, Shangping ;
Yao, Lisha ;
Chen, Juanjuan ;
Zhang, Yaling .
IEEE ACCESS, 2019, 7 :80675-80696
[32]   Finding Influential Nodes in Multiplex Networks Using a Memetic Algorithm [J].
Wang, Shuai ;
Liu, Jing ;
Jin, Yaochu .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (02) :900-912
[33]   Secure-aware and privacy-preserving electronic health record searching in cloud environment [J].
Wang, Xiao ;
Zhang, Aiqing ;
Xie, Xiaojuan ;
Ye, Xinrong .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (08)
[34]   Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization [J].
Waters, Brent .
PUBLIC KEY CRYPTOGRAPHY - PKC 2011, 2011, 6571 :53-70
[35]  
Xiaodong D., 2002, IEEE S SECURITY PRIV
[36]   A CP-ABE scheme based on multi-authority in hybrid clouds for mobile devices [J].
Xie, Mande ;
Ruan, Yingying ;
Hong, Haibo ;
Shao, Jun .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2021, 121 :114-122
[37]  
Xie Y., 2015, IEEE TRANS CLOUD COM, P1
[38]   Decentralized attribute-based conjunctive keyword search scheme with online/offline encryption and outsource decryption for cloud computing [J].
Xu, Qian ;
Tan, Chengxiang ;
Zhu, Wenye ;
Xiao, Ya ;
Fan, Zhijie ;
Cheng, Fujia .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 97 :306-326
[39]   RAAC: Robust and Auditable Access Control With Multiple Attribute Authorities for Public Cloud Storage [J].
Xue, Kaiping ;
Xue, Yingjie ;
Hong, Jianan ;
Li, Wei ;
Yue, Hao ;
Wei, David S. L. ;
Hong, Peilin .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (04) :953-967
[40]   Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms [J].
Yang, Kan ;
Zhang, Kuan ;
Jia, Xiaohua ;
Hasan, M. Anwar ;
Shen, Xuemin .
INFORMATION SCIENCES, 2017, 387 :116-131