Searchable encryption with randomized ciphertext and randomized keyword search

Abstract

Abstract The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, we propose a PEKS scheme in which both the encrypted keyword and the trapdoor are randomized so that the cloud server is not able to recognize identical queries a priori. Our scheme is Ciphertext-Indistinguishabiltity secure in the single-user setting and Trapdoor-Indistinguishability secure in the multi-user setting with a stronger security, i.e., with multi-trapdoor.