scholarly journals Efficient Conjunctive Keywords Search over Encrypted E-Mail Data in Public Key Setting

2019 ◽  
Vol 9 (18) ◽  
pp. 3655 ◽  
Author(s):  
Yu Zhang ◽  
Yin Li ◽  
Yifan Wang
Keyword(s):  
Public Key ◽  
Mobile Cloud ◽  
Public Key Encryption ◽  
Cloud Environment ◽  
Bilinear Map ◽  
Encrypted Data ◽  
Searchable Public Key Encryption ◽  
Guessing Attack ◽  
Mail System ◽  
E Mail

Searchable public key encryption supporting conjunctive keywords search (SPE-CKS) enables data users to retrieve the encrypted data of interest from an untrusted server. Based on SPE-CKS, one can realize a multi-keywords search over the encrypted e-mails. In this paper, we propose an efficient SPE-CKS scheme by utilizing a keyword conversion method and the bilinear map technique. Our scheme is proven to be secure against chosen keyword attack under a standard security definition and can also withstand the keywords guessing attack. Furthermore, we design an experiment over a real world e-mail dataset to illustrate that our scheme has a better performance on time and space complexities than the previous schemes. A detailed analysis shows that our scheme is very practical for the encrypted e-mail system in the mobile cloud environment.

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.

scholarly journals Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Daini Wu ◽  
Xiaoming Wang ◽  
Qingqing Gan
Keyword(s):  
Data Privacy ◽  
Keyword Search ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Public Key ◽  
Public Key Encryption ◽  
Encrypted Data ◽  
Cloud Server ◽  
Learning With Errors ◽  
Multiuser Environments

A public key encryption scheme with keyword search capabilities is proposed using lattices for applications in multiuser environments. The proposed scheme enables a cloud server to check if any given encrypted data contains certain keywords specified by multiple users, but the server would not have knowledge of the keywords specified by the users or the contents of the encrypted data, which provides data privacy as well as privacy for user queries in multiuser environments. It can be proven secure under the standard learning with errors assumption in the random oracle model.

Sign in / Sign up

Export Citation Format

Share Document