Cryptology ePrint Archive: Report 2005/191

Public Key Encryption with Keyword Search Revisited

Joonsang Baek and Reihaneh Safavi-Naini and Willy Susilo

Abstract: The public key encryption with keyword search (PEKS) scheme recently proposed by Boneh, Di Crescenzo, Ostrovsky, and Persiano enables one to search encrypted keywords without compromising the security of the original data. In this paper, we address three important issues of a PEKS scheme, ``refreshing keywords'', ``removing secure channel'', and ``processing multiple keywords'', which have not been considered in Boneh et. al.'s paper. We argue that care must be taken when keywords are used frequently in the PEKS scheme as this situation might contradict the security of PEKS. We then point out the inefficiency of the original PEKS scheme due to the use of the secure channel. We resolve this problem by constructing an efficient PEKS scheme that removes secure channel. Finally, we propose a PEKS scheme that encrypts multiple keywords efficiently.

Category / Keywords: public-key cryptography /

Date: received 23 Jun 2005

Contact author: baek at uow edu au

Available format(s): PDF | BibTeX Citation

Version: 20050623:094140 (All versions of this report)

Short URL: ia.cr/2005/191

Discussion forum: Show discussion | Start new discussion