Server-aided public key encryption with keyword search

• Main Authors: CHEN, Rongman, MU, Yi, YANG, Guomin, GUO, Fuchun, HUANG, Xinyi, WANG, Xiaofen, WANG, Yongjun
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: off-line keyword guessing attack; Public key encryption with keyword search; server-aided; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/7359; https://ink.library.smu.edu.sg/context/sis_research/article/8362/viewcontent/Server_Aided_Public_Key_Encryption_With_Keyword_Search.pdf
• Institution: Singapore Management University

Public key encryption with keyword search (PEKS) is a well-known cryptographic primitive for secure searchable data encryption in cloud storage. Unfortunately, it is inherently subject to the (inside) offline keyword guessing attack (KGA), which is against the data privacy of users. Existing countermeasures for dealing with this security issue mainly suffer from low efficiency and are impractical for real applications. In this paper, we provide a practical and applicable treatment on this security vulnerability by formalizing a new PEKS system named server-aided public key encryption with keyword search (SA-PEKS). In SA-PEKS, to generate the keyword ciphertext/trapdoor, the user needs to query a semitrusted third-party called keyword server (KS) by running an authentication protocol, and hence, security against the offline KGA can be obtained. We then introduce a universal transformation from any PEKS scheme to a secure SA-PEKS scheme using the deterministic blind signature. To illustrate its feasibility, we present the first instantiation of SA-PEKS scheme by utilizing the Full Domain Hash RSA signature and the PEKS scheme proposed by Boneh et al. in Eurocrypt 2004. Finally, we describe how to securely implement the client-KS protocol with a rate-limiting mechanism against online KGA and evaluate the performance of our solutions in experiments.