Multi-Keywords Searchable Attribute-Based Encryption With Verification and Attribute Revocation Over Cloud Data

doi:10.1109/ACCESS.2023.3334733

Return

Multi-Keywords Searchable Attribute-Based Encryption With Verification and Attribute Revocation Over Cloud Data

2023-01-01

DOI：10.1109/ACCESS.2023.3334733

Original

Original request for help

Save

Abstract

En 中文

The convenience and efficient management of cloud servers have resulted in an increasing number of users opting to store their data in the cloud. Consequently, data-outsourcing services relying on cloud servers have been extensively deployed and utilized. In this case, before outsourcing the data to cloud storage, we should ensure unauthorized users cannot access the data. In this article, we present a scheme termed MKSABE-VaAR (multi-keyword searchable attribute-based encryption with verification and attribute revocation). Aiming at the problems of inefficiency, excessive computation in the search process, and only supporting single-keyword search in most attribute-based searchable encryption schemes, first, we package multiple keywords into a polynomial to realize multi-keyword search. Based on this polynomial, MKSABE-VaAR can reduce the amount of search calculation for keyword ciphertext and improve search efficiency by reducing the number of bilinear pairing operations. At the same time, we have made some special constructs for indexing to add verification of user attributes in the keyword search process, which improves the search accuracy. Moreover, we adopt a linear secret-sharing technique to construct the attribute revocation function of MKSABE-VaAR, making a lower computational cost of attribute revocation. Furthermore, the mechanism of storing data and indexes separately greatly reduces the risk of data leakage of MKSABE-VaAR.

Keywords:

Searchable encryption

attribute-based encryption

linear secret sharing

attribute revocation