Authors: Run Xie; Chunxiang Xu; Chanlian He; Xiaojun Zhang
Addresses: School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; School of Mathematical, Yibin University, Yibin 644000, China ' School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China ' School of Computer and Information Engineering, Yibin University, Yibin 644000, China ' School of Computer Science, Southwest Petroleum University, Chengdu 610500, China
Abstract: With the improvement of awareness of data privacy, the user's sensitive data are usually encrypted before uploading them to cloud. Searchable encryption is a critical technique on promoting secure and efficient cloud storage. In particular, publickey encryption with keyword search (PEKS) provides an elegant approach to achieve data retrieval in encrypted storage. All existing searchable publickey encryption schemes only provide the security based on classical cryptography hardness assumption. With the development of quantum computers, these schemes will be insecure. Based on the lattice hardness assumptions, we propose a new searchable publickey encryption scheme with a designated tester (dPEKS). Our scheme has advantages: First, our scheme is the first searchable publickey encryption scheme that is considered to be secure even if quantum computers are ever developed. Second, our scheme achieves the trapdoor indistinguishability. The trapdoor indistinguishability implies the security against outside offline keyword guessing attacks (KGAs). Last, our scheme can achieve the trapdoor anonymity for server.
Keywords: cloud storage; keyword-guessing attack; lattice; searchable encryption; trapdoor indistinguishability.
International Journal of Web and Grid Services, 2018 Vol.14 No.1, pp.3 - 20
Available online: 13 Nov 2017Full-text access for editors Access for subscribers Purchase this article Comment on this article