Cryptanalysis of the existing integrated PKE and PEKS schemes
by Yang Lu; Qi Zeng
International Journal of Embedded Systems (IJES), Vol. 11, No. 5, 2019

Abstract: Public key encryption with keyword search (PEKS) is a useful cryptographic primitive which allows one to delegate to an untrusted storage server the capability of searching on publicly encrypted data without impacting the security and privacy of original data. However, due to lack of data encryption/decryption function, a PEKS scheme cannot be used alone but has to be coupled with a standard public key encryption (PKE) scheme. For this reason, a new cryptographic primitive called integrated PKE and PEKS (PKE/PEKS) was introduced by Baek et al. in 2006, which provides the functions of both PKE and PEKS. So far, several PKE/PEKS schemes have been proposed in the literature. However, none of them considers the keyword guessing attack. The first PKE/PEKS scheme proposed by Baek et al. was shown to be insecure under this attack. In this paper, we analyse the security of other PKE/PEKS schemes. We demonstrate that none of these schemes can resist the keyword guessing attack. The presented attacks show that a malicious storage server can successfully guess the keyword encoded in any keyword trapdoor produced by these schemes. Therefore, it is still an unsolved problem to devise a PKE/PEKS scheme withstanding the keyword guessing attack.

Online publication date: Tue, 24-Sep-2019

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 Embedded Systems (IJES):
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