Semantic keyword searchable proxy re‐encryption for postquantum secure cloud storage. (20th June 2017)

• Record Type: Journal Article
• Authors: Yang, Yang; Zheng, Xianghan; Chang, Victor; Tang, Chunming
• Other Names: Bu Kai guestEditor.; Xiao Bin guestEditor.; Qian Yi guestEditor.; Dong Fang guestEditor.; Shen Jun guestEditor.
• Is Part Of: Concurrency and computation. Volume 29:Number 19(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-06-20
• Subjects: cloud storage -- postquantum secure -- proxy re‐encrytion -- semantic searchable encryption; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4211
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: With the advent of cloud computing, more and more consumers prefer to use the cloud services with the pay‐as‐you‐consume mode. The cloud storage brings about great convenience to users, who store data in cloud and access to it using the smart devices anytime and anywhere. Consumers' information should be encrypted to guarantee the data privacy. Flexible searching on ciphertext is a critical challenge to be solved for effective data utilization. In this paper, we propose a novel semantic keyword searchable proxy re‐encryption scheme for secure cloud storage. A highlight of this work is that the scheme is quantum attack resistant, while most of the available searchable encryption schemes are not. It supports not only exact keyword search but also synonym keyword search. Moreover, the data owner is capable to delegate his search right to another user using the proxy re‐encryption mechanism. In the generation process of re‐encryption key, the delegator and delegatee do not need to be interactive with each other. The scheme is also collusion resistant. Under the learning with errors hardness problem, this scheme is proved secure in standard model.