Abstract
In a secure data sharing system, users can selectively retrieve encrypted files by performing keyword search over the ciphertext of data. Most of the existing searchable encryption schemes can provide security protection for both data owner and users. Nevertheless, three pivotal issues need to be addressed. Firstly, the cloud might return a wrong result or incomplete result for some reasons, e.g., saving the computing resources. Secondly, users need to store massive keys to generate trapdoors and decrypt the ciphertext of data, which brings great challenges to users’ key management. Thirdly, when users perform keyword search over a large number of files, they need to generate and submit massive trapdoors, which is unrealistic. Proceeding from these points, in this paper, we propose an efficient verifiable key-aggregate keyword searchable encryption (EVKAKSE) scheme. In this scheme, the data owner distributes only one aggregate key to users for keyword search, decryption and verification, who can use the aggregate key to generate a single trapdoor for keyword search over shared files. Generally, we define the requirements of the scheme, analyze the threat models and give a valid construction. Furthermore, our security analysis and experimental evaluation demonstrate that the scheme is efficient and secure.
Highlights
With the increasing storage demand of enterprises and individuals, cloud storage has been widely used in recent years
We address a decryption key redundancy problem that exists in most searchable encryption scheme with aggregate key
Theoretical analysis and experimental evaluation indicate that the proposed scheme gives better consideration to both security and efficiency
Summary
With the increasing storage demand of enterprises and individuals, cloud storage has been widely used in recent years. 6) Extract(msk, reqindex , S): The data owner uses this algorithm to generate an aggregate searchable encryption key for the users with the access right of a selected files set S. Definition 1 (Correctness): Given some search task for the keyword w ∈ W of some files, a secure keyaggregate searchable encryption scheme is correct if (g, h, B, H0, H1, Enc, Dec) ← Setup(k), (pk, msk) ← KeyGen, reqindex ← BuildIndex, (C, i, cw) ← Encrypt(pk, reqindex , i), tagw ← TagGen(W , F w) and Kagg ← Extract(msk, reqindex , S) such that, for any valid trapdoors submitted by an authorized user (Tr, S) ← Trapdoor(Kagg, w), the cloud will request adjust parameters from the aid server {pubi|i ∈ S} ← Adjust(S) and perform keyword search over certain encrypted files cpubi ← Test(Tr, i, S, reqindex , pubi, i). Definition 3 (Search Control): A valid user cannot perform keyword search for unauthorized files successfully with the known aggregate key, and the Test algorithm will always return false
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
