Title: Public-key searchable encryption from lattices

Authors: Changjiang Hou; Fei Liu; Hongtao Bai; Lanfang Ren

Addresses: China Mobile Communications Corporation Research Institute, 32 Xuanwumen West Street, Xicheng District, Beijing 100053, China ' China Mobile Communications Corporation Research Institute, 32 Xuanwumen West Street, Xicheng District, Beijing 100053, China ' China Mobile Communications Corporation Research Institute, 32 Xuanwumen West Street, Xicheng District, Beijing 100053, China ' China Mobile Communications Corporation Research Institute, 32 Xuanwumen West Street, Xicheng District, Beijing 100053, China

Abstract: Searchable encryption, which allows one to search over encrypted data, has recently become an important research direction in cryptography. According to the key generation algorithm, searchable encryption can be divided into two categories, which are referred to as secret-key setting and public-key setting. Among them, searchable public-key encryption is of particular interest since it has found numerous practical applications, such as cloud storage and outsourced computing. In this work, we propose two searchable public-key encryption schemes from lattice. One is probabilistic, while the other is deterministic. Both of them are proven secure in the random oracle model.

Keywords: public key encryption; searchable encryption; provably secure; lattices; learning with errors; LWE; probabilistic; deterministic; standard model; random oracle model; anonymity; cloud storage; cloud computing; cryptography; security.

DOI: 10.1504/IJHPSA.2014.059867

International Journal of High Performance Systems Architecture, 2014 Vol.5 No.1, pp.25 - 32

Received: 19 Aug 2013
Accepted: 24 Sep 2013

Published online: 17 Mar 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article