Semantic keyword searchable proxy re‐encryption for postquantum secure cloud storage
- 20 June 2017
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 29 (19)
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.Keywords
Funding Information
- National Natural Science Foundation of China (61402112, 61502106, 61472307, 61472309, 61303198)
This publication has 20 references indexed in Scilit:
- Protecting Your Right: Verifiable Attribute-Based Keyword Search with Fine-Grained Owner-Enforced Search Authorization in the CloudIEEE Transactions on Parallel and Distributed Systems, 2014
- Proxy Re-encryption from Lattices2014
- Nonlinear order preserving index for encrypted database query in service cloud environmentsConcurrency and Computation: Practice and Experience, 2013
- Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryptionInformation Sciences, 2012
- Learning with error based searchable encryption schemeJournal of Electronics (China), 2012
- More efficient CCA‐secure unidirectional proxy re‐encryption schemes without random oraclesSecurity and Communication Networks, 2012
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- CCA-Secure Proxy Re-encryption without Pairings2009
- Public Key Encryption with Keyword Search2004
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997