Public-key searchable encryption from lattices
by Changjiang Hou; Fei Liu; Hongtao Bai; Lanfang Ren
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 5, No. 1, 2014

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.

Online publication date: Sat, 12-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com