Authors:
Koon-Ming Chan
;
Swee-Huay Heng
;
Syh-Yuan Tan
and
Shing-Chiang Tan
Affiliation:
Faculty of Information Science and Technology, Multimedia University, Jalan Ayer Keroh Lama, 75450 Melaka, Malaysia
Keyword(s):
PEKS, PAEKS, KGA.
Abstract:
The public key encryption with keyword search (PEKS) scheme is a cryptographic primitive introduced to securely store and allow specific searches within encrypted data. Traditional encryption prioritises confidentiality but complicates search operations, requiring decryption before searches can be conducted. PEKS scheme addresses this limitation by enabling authorised users to search for specific keywords within encrypted data without compromising the underlying encryption. This facilitates efficient and secure data retrieval without the need to decrypt the entire dataset. However, PEKS is susceptible to the keyword guessing attack (KGA), exploiting the deterministic nature of the PEKS trapdoor so the adversary can correctly guess the keyword encrypted in a trapdoor. To enhance PEKS security to counter KGA, various schemes have been proposed. A notable one is public key authenticated encryption with keyword search (PAEKS). PAEKS combines authentication and encryption with keyword-bas
ed search functionalities, ensuring data source authentication, encrypted information security, and keyword-based searches. This approach offers a more robust and secure alternative to traditional PEKS. However, many existing PAEKS schemes rely on computationally exhaustive bilinear pairing. In this paper, we propose a PAEKS scheme based on k-resilient identity-based encryption without bilinear pairing. By using the provable security approach, we show that our proposed PAEKS scheme satisfies keyword privacy and trapdoor privacy. Furthermore, we also present a performance evaluation of our proposed PAEKS scheme with other related PAEKS schemes and show the efficiency of our proposed scheme.
(More)