Abstract
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.
Highlights
N OWADAYS, cloud computing is considered a new enterprise IT service
A data user private key is labeled with an access policy, which will dictate which ciphertext this data user is allowed to decrypt [10] as the data users are in direct control of adding or removing unique attributes in KP-Attribute-Based Encryption (ABE), which makes it is beneficial in the application scenario where direct revocation is mandatory
There are broadly three approaches to enhance the efficiency of attribute-based keyword search (ABKS): Non-paring, as the name suggests, this approach avoids the time-consuming and most expensive bilinear operations with lighters one, i.e., Elliptic Curve Cryptography (ECC)
Summary
N OWADAYS, cloud computing is considered a new enterprise IT service. In cloud computing architecture, online storage services, e.g., Amazon’s S3, Azure cloud storage, and Apple iCloud, are regarded as efficient data storage services over the cloud. A data user private key is labeled with an access policy, which will dictate which ciphertext this data user is allowed to decrypt [10] as the data users are in direct control of adding or removing unique attributes in KP-ABE, which makes it is beneficial in the application scenario where direct revocation is mandatory Both variants of attribute-based encryption are applicable in the keyword search. There are broadly three approaches to enhance the efficiency of attribute-based keyword search (ABKS): Non-paring, as the name suggests, this approach avoids the time-consuming and most expensive bilinear operations with lighters one, i.e., Elliptic Curve Cryptography (ECC) This approach fails to avoid the underlying linearity problem of ABE. Because of its pre-computation support, our proposed scheme uses this technique for its index and token generation
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
