iPEKS: Fast and Secure Cloud Data Retrieval from the Public-Key Encryption with Keyword Search

2013 ◽  
Author(s):  
Fu-Kuo Tseng ◽  
Rong-Jaye Chen ◽  
Bao-Shuh Paul Lin
Keyword(s):  
Keyword Search ◽  
Data Retrieval ◽  
Public Key ◽  
Public Key Encryption ◽  
Cloud Data ◽  
The Public

ISEkFT

2019 ◽  
Vol 12 (3) ◽  
pp. 133-153 ◽  
Author(s):  
Mamta ◽  
Brij B. Gupta ◽  
Syed Taqi Ali
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
The Public ◽  
Fuzzy Search ◽  
Cloud Server ◽  
Fuzzy Keyword Search ◽  
Identity Based ◽  
Guessing Attack ◽  
Overall Reliability

Public-key encryption with keyword search (PEKS) is a well-known technique which allows searching on encrypted data using the public key system. However, this technique suffers from the keyword guessing attack (KGA). To address this problem, a modified version of PEKS called public key encryption with fuzzy keyword search (PEFKS) has been introduced where each keyword is associated with an exact search trapdoor (EST) and a fuzzy search trapdoor (FST) which is provided to the cloud server. PEFKS prevents KGA in such a way that two or maximum three keywords share the same FST. Hence, even if the cloud server knows the FST it cannot link it to the corresponding keyword. But, with a probability of 1/3 the malicious cloud server can still guess the keyword corresponding to FST. Therefore, in this article, the authors present an approach which can improve the security of the PEFKS technique by reducing the probability of guessing the keyword to 1/k where k is the number of keywords that share the same FST, thus enhancing the overall reliability. In addition, the authors have used an identity-based encryption (IBE) as an underlying technique to construct the searchable encryption scheme and proved its security in the standard model.

scholarly journals Conjunctive and Disjunctive Keyword Search over Encrypted Mobile Cloud Data in Public Key System

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang
Keyword(s):  
Vector Space ◽  
Keyword Search ◽  
Vector Space Model ◽  
Public Key ◽  
Inner Product ◽  
Mobile Cloud ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Cloud Data ◽  
Space Model

The searchable encryption scheme can perform keywords search operation directly over encrypted data without decryption, which is crucial to cloud storage, and has attracted a lot of attention in these years. However, it is still an open problem to develop an efficient public key encryption scheme supporting conjunctive and a disjunctive keyword search simultaneously. To achieve this goal, we introduce a keyword conversion method that can transform the query and index keywords into a vector space model. Through applying a vector space model to a predicate encryption scheme supporting inner product, we propose a novel public key encryption scheme with conjunctive and disjunctive keyword search. The experiment result demonstrates that our scheme is more efficient in both time and space as well as more suitable for the mobile cloud compared with the state-of-art schemes.

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

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.

Sign in / Sign up

Export Citation Format

Share Document