Public Key Authenticated Encryption With Designated Equality Test and its Applications in Diagnostic Related Groups

Wang, Yuanhao; Huang, Qiong; Li, Hongbo; Huang, Jianye; Yang, Guomin; Susilo, Willy

doi:10.1109/access.2019.2940646

Cited by 11 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aside from secure searchable solutions for IIoT, effective access control on the outsourced data is also important. Inconsequent to this, Wang et al 25 proposed a public‐key authenticated encryption with designated equality test which could resist attacks launched by an inside adversary such as the offline message recovery attack. In their scheme, the sender specifies the authorized user to the ciphertexts while encrypting a message to prevent outside adversaries from testing.…”

Section: Related Workmentioning

confidence: 99%

A certificateless keyword searchable encryption scheme in multi‐user setting for fog‐enhanced Industrial Internet of Things

Olakanmi

Odeyemi

2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Industrial Internet of Things (IIoT), an appendage of the Internet of Things (IoT), upgrades conventional industries to intelligent and autonomous industries. It integrates different intelligent terminals, sensors, actuators, mobile devices, cloud computing through wireless communication to enhance operational efficiency and safety. However, it relies on the powerful data processing and unlimited storage capabilities of cloud computing by outsourcing its data and on‐demand services to the cloud server. This introduces privacy and confidentiality issues, and a high cost of data access on IIoT, especially for location bound data retrieval. To enforce confidentiality in IIoT, encryption techniques are being adapted to secure the outsourced data, but not without impeding the data searching operation. Several searchable encryption schemes have been proposed for secure and privacy‐preserving data retrieval in IIoT. However, most of these schemes not only completely relied on the cloud server but also susceptible to inside keyword guessing attack (IKGA). Besides, some of them use high computation intensive cryptography operations that make them computationally intensive for resource‐constrained data users and owners. In this article, we develop a lightweight searchable public‐key encryption scheme. The scheme is provably secure against IKGA. It contains a secure key distribution approach for generating and distributing the symmetric encryption key and allows secure ciphertext data search and retrieval in a multi‐user setting without compromising privacy. Finally, we analyze and evaluate the performance of the proposed scheme by comparing the results with some recent state‐of‐the‐art schemes to quantitatively show the capabilities of the scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

A certificateless keyword searchable encryption scheme in multi‐user setting for fog‐enhanced Industrial Internet of Things

Olakanmi

Odeyemi

2021

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…To make the authorization more flexible, Ma et al [7] proposed a flexible PKEET scheme, which supports four types of authorization. Subsequently, a variety of enhanced schemes [12]- [14] have been proposed to improve security. Zhang et al [12] proposed an efficient PKEET scheme under a specific cryptographic assumption in the standard model.…”

Section: A Related Workmentioning

confidence: 99%

Attribute-Based Equality Test Over Encrypted Data Without Random Oracles

et al. 2020

Self Cite

View full text Add to dashboard Cite

Sensitive data would be encrypted before uploading to the cloud due to the privacy issue. However, how to compare the encrypted data efficiently becomes a problem. Public Key Encryption with Equality Test (PKEET) provides an efficient way to check whether two ciphertexts (of possibly different users) contain the same message without decryption. As an enhanced variant, Attribute-based Encryption with Equality Test (ABEET) provides a flexible mechanism of authorization on the equality test. Most of the existing ABEET schemes are only proved to be secure in the random oracle model. Their security, however, would not be guaranteed if random oracles are replaced with real-life hash functions. In this work, we propose a construction of CP-ABEET scheme and prove its security based on some reasonable assumptions in the standard model. We then show how to modify the scheme to outsource complex computations in decryption and equality test to a third-party server in order to support thin clients. INDEX TERMS Attribute-based encryption, equality test, outsourced decryption, standard model, deduplication.

show abstract

“…As both server could not check ciphertext and trapdoor independently, this construction could resist IKGA. On the other side, various works have been proposed to overcome OMRA [10], [31], [32]. Similar with [29], [30], Tang and Ling improved PKEET with supporting of finegrained authorization [15] and flexible authorization [33] respectively, whose dual-server construction could also resist OMRA.…”

Section: A Related Workmentioning

confidence: 99%

“…Therefore we should first encrypt the data then store it in untrusted cloud servers. When searching encrypted data, a typical way is public-key encryption with keyword search (PEKS) [2]- [10]. PEKS provides a primitive that using a trapdoor from keyword and secret key to search ciphertexts.…”

Section: Introductionmentioning

confidence: 99%

Plaintext-Verifiably-Checkable Encryption and Its Extension in Dual-Server Setting

Zhong

Huang

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Plaintext-checkable encryption (PCE), first introduced by Canard et al. [1], allows users searching on encrypted data through plaintexts. It provides a useful primitive in the cloud computing security. However, existing PCE schemes could not guarantee verifiability to prevent from malicious adversaries. To concentrate with, we provide the notion of plaintext-verifiably-checkable encryption (PVCE). Our PVCE scheme could check that if a ciphertext is valid, even though it could pass the check procedure, to avoid malicious ciphertexts. Furthermore, we extend the work in dual-server setting, called dual-server plaintext-verifiably-checkable encryption (DS-PVCE), to resist offline message recover attack. We also give the security definition IND-CCA-FS, IND-CCA-BS and IND-CCA-BS-II in standard model for DS-PVCE and prove that DS-PVCE is secure under these security notions. Then we give constructions of PVCE and DS-PVCE from pairing-friendly smooth projective hash function (PF-SPHF) and their instantiations based on k-MDDH assumption. At the end of this paper, we provide implementation to compare existing PCE schemes and our schemes, which shows that DS-PVCE has very high check efficiency compared with other PCE schemes. INDEX TERMS Plaintext-checkable encryption, verifiability, pairing-friendly smooth projective hash function, dual-server, offline message recover attack, k-MDDH assumption.

show abstract

Public Key Authenticated Encryption With Designated Equality Test and its Applications in Diagnostic Related Groups

Cited by 11 publications

References 31 publications

A certificateless keyword searchable encryption scheme in multi‐user setting for fog‐enhanced Industrial Internet of Things

A certificateless keyword searchable encryption scheme in multi‐user setting for fog‐enhanced Industrial Internet of Things

Attribute-Based Equality Test Over Encrypted Data Without Random Oracles

Plaintext-Verifiably-Checkable Encryption and Its Extension in Dual-Server Setting

Contact Info

Product

Resources

About