A new general framework for secure public key encryption with keyword search

• Main Authors: CHEN, Rongmao, MU, Yi, YANG, Guomin, GUO, Fuchun, WANG, Xiaofen
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2015
• Subjects: Dual-server public key encryption with search; Smooth projective hash function; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/7372; https://ink.library.smu.edu.sg/context/sis_research/article/8375/viewcontent/A_New_Public_Remote_Integrity_Checking_Scheme_with_User_Privacy.pdf
• Institution: Singapore Management University

Public Key Encryption with Keyword Search (PEKS), introduced by Boneh et al. in Eurocrypt’04, allows users to search encrypted documents on an untrusted server without revealing any information. This notion is very useful in many applications and has attracted a lot of attention by the cryptographic research community. However, one limitation of all the existing PEKS schemes is that they cannot resist the Keyword Guessing Attack (KGA) launched by a malicious server. In this paper, we propose a new PEKS framework named Dual-Server Public Key Encryption with Keyword Search (DS-PEKS). This new framework can withstand all the attacks, including the KGA from the two untrusted servers, as long as they do not collude. We then present a generic construction of DS-PEKS using a new variant of the Smooth Projective Hash Functions (SPHFs), which is of independent interest.