The Public Verifiability of Public Key Encryption with Keyword Search

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering - Mobile Networks and Management ◽

10.1007/978-3-319-90775-8_24 ◽

2018 ◽

pp. 299-312

Author(s):

Binrui Zhu ◽

Jiameng Sun ◽

Jing Qin ◽

Jixin Ma

Keyword(s):

Keyword Search ◽

Public Key ◽

Public Key Encryption ◽

The Public ◽

Public Verifiability

Download Full-text

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

2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications ◽

10.1109/trustcom.2013.57 ◽

2013 ◽

Cited By ~ 6

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

Download Full-text

ISEkFT

Journal of Information Technology Research ◽

10.4018/jitr.2019070108 ◽

2019 ◽

Vol 12 (3) ◽

pp. 133-153 ◽

Cited By ~ 1

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.

Download Full-text