Tree-Based Public Key Encryption with Conjunctive Keyword Search

Searchable public key encryption supporting conjunctive keyword search is an important technique in today’s cloud environment. Nowadays, previous schemes usually take advantage of forward index structure, which leads to a linear search complexity. In order to obtain better search efficiency, in this paper, we utilize a tree index structure instead of forward index to realize such schemes. To achieve the goal, we first give a set of keyword conversion methods that can convert the index and query keywords into a group of vectors and then present a novel algorithm for building index tree based on these vectors. Finally, by combining an efficient predicate encryption scheme to encrypt the index tree, a tree-based public key encryption with conjunctive keyword search scheme is proposed. The proposed scheme is proven to be secure against chosen plaintext attacks and achieves a sublinear search complexity. Moreover, both theoretical analysis and experimental result show that the proposed scheme is efficient and feasible for practical applications.

Download Full-text

Efficient Boolean Keywords Search over Encrypted Cloud Data in Public Key Setting

Mobile Information Systems ◽

10.1155/2020/2904861 ◽

2020 ◽

Vol 2020 ◽

pp. 1-15

Author(s):

Yu Zhang ◽

Wei He ◽

Yin Li

Keyword(s):

Cloud Computing ◽

Vector Space ◽

Experimental Analysis ◽

Keyword Search ◽

Public Key ◽

Public Key Encryption ◽

Data Confidentiality ◽

Cloud Data ◽

Searchable Public Key Encryption ◽

Query Operations

Searchable public key encryption- (SPE-) supporting keyword search plays an important role in cloud computing for data confidentiality. The current SPE scheme mainly supports conjunctive or disjunctive keywords search which belongs to very basic query operations. In this paper, we propose an efficient and secure SPE scheme that supports Boolean keywords search, which is more advanced than the conjunctive and disjunctive keywords search. We first develop a keyword conversion method, which can change the index and Boolean keywords query into a group of vectors. Then, through applying a technique so-called dual pairing vector space to encrypt the obtained vectors, we propose a concrete scheme proven to be secure under chosen keyword attack. Finally, we put forward a detailed theoretical and experimental analysis to demonstrate the efficiency of our scheme.

Download Full-text

Secure and Efficient Searchable Public Key Encryption for Resource Constrained Environment Based on Pairings under Prime Order Group

Security and Communication Networks ◽

10.1155/2019/5280806 ◽

2019 ◽

Vol 2019 ◽

pp. 1-14 ◽

Cited By ~ 5

Author(s):

Yu Zhang ◽

Yin Li ◽

Yifan Wang

Keyword(s):

Prime Order ◽

Keyword Search ◽

Bilinear Pairing ◽

Public Key ◽

Inner Product ◽

Public Key Encryption ◽

Time And Space ◽

Space Efficiency ◽

Order Group ◽

Searchable Public Key Encryption

Searchable public key encryption scheme is a key technique for protecting data confidentiality in today’s cloud environment. Specifically, public key encryption with conjunctive and disjunctive keyword search (PECDK) can provide flexible search options without sacrificing keywords security and thus attracts a lot of attention nowadays. However, the most effective PECDK scheme is based on the inner product encryption (IPE), which needs more time and space cost. In this paper, by utilizing the bilinear pairing with a prime order group, we propose an efficient PECDK scheme needing less time and storage consumption. The proposed scheme is proven to be secure under a rigorous security definition. The theoretical analysis and experimental results demonstrate that our proposed scheme can significantly improve the time and space efficiency over the state-of-the-art scheme.

Download Full-text

Public Key Encryption with Keyword Search in Cloud: A Survey

Entropy ◽

10.3390/e22040421 ◽

2020 ◽

Vol 22 (4) ◽

pp. 421 ◽

Cited By ~ 3

Author(s):

Yunhong Zhou ◽

Na Li ◽

Yanmei Tian ◽

Dezhi An ◽

Licheng Wang

Keyword(s):

Keyword Search ◽

Public Key ◽

Future Research ◽

Public Key Encryption ◽

Encrypted Data ◽

Research Survey ◽

Attribute Based Encryption ◽

Cryptographic Primitive ◽

Potential Applications ◽

Predicate Encryption

With the popularization of cloud computing, many business and individuals prefer to outsource their data to cloud in encrypted form to protect data confidentiality. However, how to search over encrypted data becomes a concern for users. To address this issue, searchable encryption is a novel cryptographic primitive that enables user to search queries over encrypted data stored on an untrusted server while guaranteeing the privacy of the data. Public key encryption with keyword search (PEKS) has received a lot of attention as an important branch. In this paper, we focus on the development of PEKS in cloud by providing a comprehensive research survey. From a technological viewpoint, the existing PEKS schemes can be classified into several variants: PEKS based on public key infrastructure, PEKS based on identity-based encryption, PEKS based on attribute-based encryption, PEKS based on predicate encryption, PEKS based on certificateless encryption, and PEKS supporting proxy re-encryption. Moreover, we propose some potential applications and valuable future research directions in PEKS.

Download Full-text