[Resource Topic] 2005/191: Public Key Encryption with Keyword Search Revisited

Welcome to the resource topic for 2005/191

Public Key Encryption with Keyword Search Revisited

Authors: Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo


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.

ePrint: https://eprint.iacr.org/2005/191

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .