Cryptology ePrint Archive: Report 2018/007

An Efficient Public-Key Searchable Encryption Scheme Secure against Inside Keyword Guessing Attacks

Qiong Huang and Hongbo Li

Abstract: How to efficiently search over encrypted data is an important and interesting problem in the cloud era. To solve it, Boneh et al. introduced the notion of public key encryption with keyword search (PEKS), in 2004. However, in almost all the PEKS schemes an inside adversary may recover the keyword from a given trapdoor by exhaustively guessing the keywords offline. How to resist the inside keyword guessing attack in PEKS remains a hard problem. In this paper we propose introduce the notion of Public-key Authenticated Encryption with Keyword Search (PAEKS) to solve the problem, in which the data sender not only encrypts a keyword, but also authenticates it, so that a verifier would be convinced that the encrypted keyword can only be generated by the sender. We propose a concrete and efficient construction of PAEKS, and prove its security based on simple and static assumptions in the random oracle model under the given security models. Experimental results show that our scheme enjoys a comparable efficiency with Boneh et al.'s scheme.

Category / Keywords: public-key cryptography / Public Key Authenticated Encryption with Keyword Search, Searchable Encryption, Keyword Guessing Attack, Random Oracle Model

Original Publication (with minor differences): Information Sceinces
DOI:
10.1016/j.ins.2017.03.038

Date: received 1 Jan 2018

Contact author: qhuang at scau edu cn

Available format(s): PDF | BibTeX Citation

Note: This is the revised version of our work published at Information Sciences, 2017.

Version: 20180102:175328 (All versions of this report)

Short URL: ia.cr/2018/007


[ Cryptology ePrint archive ]