Efficient Public Key Encryption with Disjunctive Keywords Search Using the New Keywords Conversion Method

Yu Zhang,Yifan Wang,Yin Li

doi:10.3390/info9110272

Yu Zhang, Yifan Wang + Show 1 more

Open Access

https://doi.org/10.3390/info9110272

Copy DOI

Journal: Information	Publication Date: Nov 1, 2018
Citations: 1	License type: CC BY 4.0

Affiliation: Xinyang Normal University, Wayne State University

Abstract

Public key encryption with disjunctive keyword search (PEDK) is a public key encryption scheme that allows disjunctive keyword search over encrypted data without decryption. This kind of scheme is crucial to cloud storage and has received a lot of attention in recent years. However, the efficiency of the previous scheme is limited due to the selection of a less efficient converting method which is used to change query and index keywords into a vector space model. To address this issue, we design a novel converting approach with better performance, and give two adaptively secure PEDK schemes based on this method. The first one is built on an efficient inner product encryption scheme with less searching time, and the second one is constructed over composite order bilinear groups with higher efficiency on index and trapdoor construction. The theoretical analysis and experiment results verify that our schemes are more efficient in time and space complexity as well as more suitable for the mobile cloud setting compared with the state-of-art schemes.

Highlights

Searchable encryption has attracted tremendous research attention in recent years
We build a group of artificial keyword sets with a different number of keywords in each set (i.e., n = 5; 10; 15; 20; 25), where each keyword set can be seen as an index of a document
We encrypted each keyword set with public key encryption with disjunctive keyword search (PEDK)-1 and PEDK-2, respectively, and stored these encrypted indices on our machine

Summary

Introduction

Searchable encryption has attracted tremendous research attention in recent years. This field can be applied in many situations, such as email system, database management system and document management system. Constructing such a scheme supporting complex query conditions like boolean keyword search is an important issue. Hwang and Lee [2] designed a more efficient PECK scheme under the multi-users setting. All of these schemes need keyword fields. To eliminate the keyword fields, a hidden vector encryption (HVE) scheme supporting conjunctive keyword search and range search over the encrypted data was proposed [3]

Objectives

Methods

Results

Conclusion