An efficient secure channel free searchable encryption scheme with multiple keywords

Abstract

Pubilc Key Encrytion with Keyword Search (PEKS) scheme allows users to search encrypted messages by using a particular keyword without leaking any information. Practically, users might need to relate multiple keywords to one message. To effectively encrypt multiple keywords, Baek et al. first presented a PEKS scheme with multiple keywords (MPEKS). In this paper, we come up with a new efficient secure channel free PEKS scheme with multiple keywords named SCF-MPEKS. We give formal definitions and a concrete construction of SCF-MPEKS. The proposed SCF-MPEKS scheme is secure in the presented models of indistinguishability for SCF-MPEKS. Our scheme removes the secure channel assumption between the server and the receiver, which has much better performance in terms of both computational and communication overhead than Baek et al.’s MPEKS scheme for building a secure channel is very costly.