Trapdoor-indistinguishable Secure Channel Free Public Key Encryption with Multi-Keywords Search (Student Contributions)

Ma, Yang and Kazemian, Hassan (2018) Trapdoor-indistinguishable Secure Channel Free Public Key Encryption with Multi-Keywords Search (Student Contributions). ACM International Conference Proceedings of the 11th International Conference on Security of Information and Networks. pp. 1-6.

[img]
Preview
Text
CameraReady_Paper6_Fullpaper.pdf - Accepted Version

Download (791kB) | Preview
Official URL: http://dx.doi.org/10.1145/3264437.3264465

Abstract / Description

Public Key Encryption with Keyword Search (PEKS) enables users to search encrypted messages by a specific keyword without compromising the original data security. Traditional PEKS schemes allow users to search one keyword only instead of multiple keywords. Therefore, these schemes may not be applied in practice. Besides, some PEKS schemes are vulnerable to Keyword Guessing Attack (KGA). This paper formally defines a concept of Trapdoor-indistinguishable Secure Channel Free Public Key Encryption with Multi-Keywords Search (tSCF-MPEKS) and then presents a concrete construction of tSCF-MPEKS. The proposed scheme solves multiple keywords search problem and satisfies the properties of Ciphertext Indistinguishability and Trapdoor Indistinguishability. Its security is semantic security in the random oracle models under Bilinear Diffle-Hellman (BDH) and 1-Bilinear Diffie-Hellman Inversion (1-BDHI) assumptions so that it is able to resist KGA.

Item Type: Article
Uncontrolled Keywords: Public Key Encryption with Keyword Search (PEKS), Trapdoor-indistinguishable, Keyword Guessing Attack (KGA), multiple keywords search
Subjects: 000 Computer science, information & general works
Department: School of Computing and Digital Media
Depositing User: Yang Ma
Date Deposited: 03 Dec 2018 09:38
Last Modified: 03 Dec 2018 09:38
URI: http://repository.londonmet.ac.uk/id/eprint/4033

Actions (login required)

View Item View Item