Public Key Encryption with Keyword Search Revisited

Joonsang Baek; Reihaneh Safavi-Naini; Willy Susilo

Paper 2005/191

Public Key Encryption with Keyword Search Revisited

Joonsang Baek, 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): baek @ uow edu au
History: 2005-06-23: received
Short URL: https://ia.cr/2005/191
License: CC BY

BibTeX

@misc{cryptoeprint:2005/191,
      author = {Joonsang Baek and Reihaneh Safavi-Naini and Willy Susilo},
      title = {Public Key Encryption with Keyword Search Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/191},
      year = {2005},
      url = {https://eprint.iacr.org/2005/191}
}