CLKS: Certificateless Keyword Search on Encrypted Data

Zheng, Qingji; Li, Xiangxue; Azgin, Aytac

doi:10.1007/978-3-319-25645-0_16

Cited by 23 publications

(6 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, certificateless encryption lies between conventional public key encryption and identity-based encryption, but preserves the certificateless advantages. [78] 5T exp 8T exp 4Tê 4log|G 1 | 4log|G 1 | Islam et al [81] 5T exp T exp 3T exp + 2Tê 3log|G 1 | log|G 1 | Ma et al [80] 5T exp + 3Tê [82] 10T exp 11T exp + Tê 5T exp + 2Tê 2log|G 1 | 2log|G 1 | + log|G t | Lu et al [83] 3T exp T exp T exp 2log|G t | log|Z p | Table 15. Notations for PEKS-CLE schemes.…”

Section: Discussionmentioning

confidence: 99%

“…Zheng et al [78] integrated the certificateless cryptography with keyword search and proposed a PEKS-CLE scheme that was provably secure in the standard model under the decisional linear assumption, but it cannot consider attack model. Next, Ma et al [79] proposed a new PEKS-CLE scheme supporting multiple keyword search for industrial Internet of Things deployment removed secure channel, and it was proved security in the random oracle model against a malicious PKG attack and public key replacement attack.…”

Section: Peks-cle Research and Progressmentioning

confidence: 99%

See 1 more Smart Citation

Public Key Encryption with Keyword Search in Cloud: A Survey

Zhou

Tian

et al. 2020

Entropy

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Peks-cle Research and Progressmentioning

confidence: 99%

Public Key Encryption with Keyword Search in Cloud: A Survey

Zhou

Tian

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

“…However, the size of the ciphertext is related to the number of attributes, so that the schemes have high computational costs. In 2015, Zheng et al [29] proposed a certificateless keyword search scheme, but the scheme does not ensure the authority of search results.…”

Section: Authorized Abstractearchmentioning

confidence: 99%

Cryptanalysis and Improvement on Wang et al.’s Attribute-Based Searchable Encryption Scheme

Tseng¹,

Fan²,

Wu³

et al. 2019

IJMLC

View full text Add to dashboard Cite

Searchable encryption is a powerful and useful primitive when users want to store their encrypted files on cloud storages. In this paper, we demonstrate security flaws of the searchable encryption scheme proposed by Wang et al. in 2017. Furthermore, we propose a solution to fix the flaws, and the improved scheme also largely reduces the length of the ciphertext such that it is independent of the number of the attributes.

show abstract

“…Some works investigated how to securely integrate standard public key encryption (PKE) with PEKS to form a full PKE + PEKS cryptosystem. In addition, PEKS was extended into identity‐based encryption (IBE), certificateless‐based encryption (CLE) and attribute‐based encryption …”

Section: Introductionmentioning

confidence: 99%

“…Jeong et al demonstrated that the PEKS framework inherently suffers from the offline KG attack by the malicious storage server. Yau et al showed that the dPEKS scheme proposed by Baek et al is insecure under the offline KG attack too. To deal with this problem, Rhee et al defined the security notion of keyword trapdoor indistinguishability and proved that a dPEKS scheme is secure against offline KG attacks by outside attackers if it achieves the keyword trapdoor indistinguishability.…”

Section: Introductionmentioning

confidence: 99%

Constructing designated server public key encryption with keyword search schemes withstanding keyword guessing attacks

2018

Int J Communication

View full text Add to dashboard Cite

Designated server public key encryption with keyword search (dPEKS) removes the secure channel requirement in public key encryption with keyword search (PEKS). With the dPEKS mechanism, a user is able to delegate the search tasks on the ciphertexts sent to him/her to a designated storage server without leaking the corresponding plaintexts. However, the current dPEKS framework inherently suffers from the security vulnerability caused by the keyword guessing (KG) attack. How to build the dPEKS schemes withstanding the KG attacks is still an unsolved problem up to now. In this work, we introduce an enhanced dPEKS (edPEKS) framework to remedy the security vulnerability in the current dPEKS framework. The edPEKS framework provides resistance to the KG attack by either the outside attacker or the malicious designated server. We provide a semi-generic edPEKS construction that exploits the existing dPEKS schemes. Our security proofs demonstrate that the derived edPEKS scheme achieves the keyword ciphertext indistinguishability, the keyword ciphertext unforgeability, and the keyword trapdoor indistinguishability if the underlying dPEKS scheme satisfies the keyword ciphertext indistinguishability and the hash Diffie-Hellman problem is intractable. In addition, a concrete edPEKS scheme is presented to show the instantiation of the proposed semi-generic construction.KEYWORDS designated server, keyword guessing attack, malicious designated server, outside attacker, public key encryption with keyword search

show abstract

CLKS: Certificateless Keyword Search on Encrypted Data

Cited by 23 publications

References 33 publications

Public Key Encryption with Keyword Search in Cloud: A Survey

Public Key Encryption with Keyword Search in Cloud: A Survey

Cryptanalysis and Improvement on Wang et al.’s Attribute-Based Searchable Encryption Scheme

Constructing designated server public key encryption with keyword search schemes withstanding keyword guessing attacks

Contact Info

Product

Resources

About