Verifiable and Multi-Keyword Searchable Encryption Scheme Based on LSSS

Abstract

Attribute-based Searchable Encryption (ABSE) schemes allow keyword encryption to be outsourced to cloud servers, and users can securely search for keyword ciphertext documents of interest. However, most existing searchable encryption schemes do not encourage the fine-grained search of users, and attributes are exposed to third parties easily. Moreover, ABSE schemes have high computational costs for resource-constrained clients on the user's client side. To solve the above problems, a verifiable and multi-keyword searchable encryption scheme based on linear secret sharing schemes (LSSS) is presented by us, which enables users to achieve a more efficient and secure fine-grained search of multi-keyword documents. In this scheme, access control is achieved using LSSS technology, and user attribute hiding is accomplished by hash. Furthermore, user authentication and pre-decryption are outsourced to cloud servers without leaking any information, which lessens the client's computational burden. It is demonstrated that the scheme can resist selective plaintext and selective keyword attacks in security models. In addition, the performance evaluation shows that our scheme performs well in real application scenarios.