{'fraction_non_alphanumeric': 0.015137180700094607, 'fraction_numerical': 0.0, 'mean_word_length': 4.977401129943503, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Verifiable Fuzzy Keyword Search Scheme Over Encrypted Data

As the Cloud Computing technology becomes mature, the need increases rapidly to store sensitive data securely on the cloud server. Since the cloud is not trusted, the data should be stored in an encrypted form at the server. An inherent problem is how to query the encrypted data efficiently. Recently, some searchable encryption schemes have been proposed in the literatures. Although the existing searchable encryption schemes allow a user to search the encrypted data securely without decrypting it, these solutions cannot support the verifiability of the search results. We argue that a cloud server may be selfish in order to save its computation or download bandwidth. For example, it may execute and return only a fraction of search operations and the results honestly. In this paper, we propose a verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search over encrypted data, but also enjoys the verifiability of the search outcome.