Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14]

Journal of Information Science and Engineering, Vol. 32 No. 2, pp. 425-438 (March 2016)

Semantic Searchable Encryption Scheme Based on Lattice in Quantum-Era*

1College of Mathematics and Computer Science
Fuzhou University
Fuzhou, 350108 P.R. China
2School of Electrical and Electronic Engineering
Nanyang Technological University
639798 Singapore

When data is outsourced to a remote storage server, searchable encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. These schemes may not be secure in the quantum age. Both discrete logarithms and factorization can be solved by quantum computer in a polynomial time. There are very few searchable encryption schemes that can be proved secure in post quantum age. In this paper, in order to construct a post-quantum secure scheme for future cloud storage, we suggest a public key encryption with semantic keyword search using the lattice based mechanism. The suggested scheme is proved secure against indistinguishable chosen-keyword attacks (IND-CKA) based on learning with errors (LWE) problem. This scheme is believed to be secure in quantum-era due to the quantum intractability of the LWE problem.

Keywords: lattice-based cryptography, semantic searchable encryption, chosen keyword attack, learning with errors, cloud computing

Full Text () Retrieve PDF document (201603_10.pdf)

Received September 24, 2014; revised December 2, 2014; accepted January 16, 2015.
Communicated by Hung-Min Sun.
* This work is supported by National Natural Science Foundation of China under Grant No. 61402112, 61472307, 61472309, 61303198, Science and Technology Project of Fujian Education Department under Grant No. JA12028, Science and Technology Development Foundation of Fuzhou University under Grant No. 2012-XY-17.