Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack

2013 ◽  
Vol 62 (11) ◽  
pp. 2266-2277 ◽  
Author(s):  
Peng Xu ◽  
Hai Jin ◽  
Qianhong Wu ◽  
Wei Wang
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Keyword Guessing Attack ◽  
Fuzzy Keyword Search ◽  
Guessing Attack ◽  
Provably Secure

An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme

2019 ◽  
Vol 30 (02) ◽  
pp. 255-273 ◽  
Author(s):  
Min-Shiang Hwang ◽  
Cheng-Chi Lee ◽  
Shih-Ting Hsu
Keyword(s):  
Keyword Search ◽  
Bilinear Pairing ◽  
Public Key ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Keyword Guessing Attack ◽  
Elgamal Cryptosystem ◽  
Guessing Attack ◽  
Secure Channel

The idea of public key encryption with keyword search (PEKS), proposed by Boneh et al., enables one to send a trapdoor containing a encrypted keyword to query data without revealing the keyword. In Boneh et al.’s design, the trapdoor has to be transferred through a secure channel, which is both costly and inefficient. Baek et al. then proposed an efficient secure channel free public key encryption scheme with keyword search (SCF-PEKS). After that, vast amounts of research have focused on the protection against the off-line keyword guessing attack (OKGA) by enhancing the model. However, most of the PEKS/SCF-PEKS schemes developed so far are constructed by applying bilinear pairing and are susceptible to off-line keyword guessing attacks. In this paper, we propose a new SCF-PEKS scheme based on the ElGamal cryptosystem. The proposed scheme is not only secure against off-line keyword guessing attacks but also improves the efficiency.

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 Public key encryption with temporary and fuzzy keyword search

2019 ◽  
Vol 16 (5) ◽  
pp. 3914-3935 ◽  
Author(s):  
Nyamsuren Vaanchig ◽  
◽  
Zhiguang Qin
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Fuzzy Keyword Search

A provably secure certificateless public key encryption with keyword search

2019 ◽  
Vol 42 (1) ◽  
pp. 20-28 ◽  
Author(s):  
Tsu-Yang Wu ◽  
Chien-Ming Chen ◽  
King-Hang Wang ◽  
Chao Meng ◽  
Eric Ke Wang
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Certificateless Public Key Encryption ◽  
Provably Secure
Sign in / Sign up

Export Citation Format

Share Document