FSSE: An Effective Fuzzy Semantic Searchable Encryption Scheme Over Encrypted Cloud Data

Abstract

Currently, searchable encryption has attracted considerable attention in the field of cloud computing. The existing research mainly focuses on keyword-based search schemes, most of which support the exact matching of keywords. However, keyword-based search schemes ignore spelling errors and semantic expansions of keywords. The significant drawback makes the existing techniques unsuitable in cloud computing as it greatly affects system usability and can not completely satisfy the users' search intentions. In this paper, we propose an effective fuzzy semantic searchable encryption scheme (FSSE) that supports multi-keyword search over encrypted data in cloud computing. In our scheme, we exploit a keyword fingerprint generation algorithm to generate a fingerprint set of the keyword dictionary and a fingerprint of the query keywords, and employ Hamming distance to quantify keywords similarity. Based on the proposed fingerprint generation algorithm and Hamming distance, we realize fuzzy search. Furthermore, we utilize the semantic expansion technique to expand query keywords and calculate the semantic similarity between the query keywords and the expanded word of the query keywords to achieve the semantic search. To improve the search efficiency, we construct an inverted index structure and use the vector intersection matching as well as short-circuit matching operations to effectively filter irrelevant documents. The theoretical analysis and experimental results demonstrate that our proposed scheme satisfies the security guarantee of searchable encryption, enhances system usability, and is more efficient in comparison with the state of the art schemes. INDEX TERMS Searchable encryption, cloud computing, fuzzy semantic search, multi-keyword search. I. INTRODUCTION

FTPS: Efficient fault‐tolerant dynamic phrase search over outsourced encrypted data with forward and backward privacy

“…Compared with the traditional method, Jaccard similarity and re‐encryption have been adopted to reduce the cost of calculation and storage. Liu 16 proposed a fuzzy semantic searchable encryption scheme, which uses the keyword fingerprint generation. Zhu et al 17 investigated the possible problems of searchable encryption when the server is malicious, and proposed a verifiable dynamic fuzzy keyword search scheme.…”

Pindex: Private multi-linked index for encrypted document retrieval

“…The searchable encryption schemes are primarily classified into Searchable Symmetric Encryption and Public Key Encryption with Keyword Search [2] depending upon the type of encryption primitive used and notion of provable security. The searchable encryption systems is further classified based on the type of search operation into keyword based and semantic based searchable encryption system [23]. The keyword based searchable encryption system uses either specially designed secure encrypted indexes to support search operations over encrypted data or sequential scanning of encrypted documents to support search [4].…”

Untitled

“…In this paper, we follows the same model of [24,27,28], which propose that both DO and DU are trusted parties. However, SS and FS are assumed to be "honest-but-curious" servers as in [3,9,23].…”

“…Additionally, we consider that the two involved servers there are non-collusion, as adopted by most previous solutions [28][29][30].…”