Open AccessPublic key authenticated encryption with keyword search: revisited
Author(s) -
Noroozi Mahnaz,
Eslami Ziba
Publication year - 2019
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2018.5315
Subject(s) - computer science , scheme (mathematics) , key (lock) , encryption , computer security , public key cryptography , keyword search , computation , theoretical computer science , algorithm , mathematics , information retrieval , mathematical analysis
In 2017, the notion of public key authenticated encryption with keyword search (PAEKS) and its security model was defined by Huang and Li. Their main motivation was providing security against inside keyword guessing attacks (KGA). They also proposed a concrete PAEKS scheme secure in their proposed model. In this study, the authors first show that their security model has an important drawback and therefore, cannot handle multi‐user settings. As such settings are a necessity in the public‐key environment, it is vital to improving the model to capture multiple users. This is what they do in the first part of this study. Then, they consider Huang and Li's PAEKS scheme and prove that it is not secure against inside (and even outside) KGA. Finally, they propose a modified scheme to fix the problem without any additional communication or computation costs. They further prove that the new scheme is secure in the improved model.