Fuzzy Multi Keyword Searchable Encryption Scheme Based on Counting Bloom Filter

In order to solve the problem of high computation and storage cost of keyword ciphertexts in existing encryption schemes, this paper proposes a fuzzy multi-keyword searchable encryption scheme based on counting Bloom filter. The efficient dynamic management of keywords and fuzzy matching function are realized by introducing the count Bloom filter and local sensitive hashing technique. This scheme not only improves the ciphertext retrieval efficiency, but also ensures the security under adaptive keyword selection attack. Experimental results show that this scheme exhibits good performance in both trapdoor generation time and keyword retrieval matching time.