{'fraction_non_alphanumeric': 0.03111111111111111, 'fraction_numerical': 0.0, 'mean_word_length': 5.677966101694915, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
OO-ABMS: Online/Offline-Aided Attribute-Based Multi-Keyword Search

Recently, Attribute-Based Encryption (ABE) is used as a baseline technology for keyword searching mechanisms to cater users’ security and privacy-related concerns who outsource their data to the powerful and resource-rich cloud server. Almost all the existing Attribute-Based Keyword Searching (ABKS) schemes either operate on a single-keyword or multiple; conjunctive-keyword search setting. These schemes work on the premise of an “all-or-nothing” retrieval mode, which greatly limits users’ searching capabilities. The most recent work incorporates multi-keyword ranked search in attribute-based encryption, which improves user search results accuracy and the flexibility of retrieval mode. However, these schemes demand high computation overhead, which ultimately suffers searching efficiency. This dilemma prevents further research and application of ABKS schemes, especially mobile-resource constrained devices such as mobile phones. This paper proposes an Online/Offline-aided Attribute-Based Multi-keyword Search (OOABMS) scheme to delegate most laborious computation operations to the offline phase before acquiring the attribute-based access control policy or keywords. An online phase then quickly assembles the pre-computed index or trapdoor with the required specifics when it becomes known. Theoretical comparison and simulation results show that our scheme is more efficient and practical in the real world scenario for mobile cloud computing in terms of computation overhead and flexibility.