Public-key searchable encryption from lattices

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.