Group public key encryption with equality test against offline message recovery attack

Ling, Yunhao; Ma, Sha; Huang, Qiong; Li, Ximing; Ling, Yunzhi

doi:10.1016/j.ins.2019.09.025

Cited by 30 publications

(21 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second to sixth columns reveal the computational efficiency for the algorithms of encryption, decryption, authorization, testing, and tracing. Compared to [7,16,17,35], the proposed T-GIBEwET scheme is more efficient than [7,16,17] in the decryption algorithm and more efficient than [17] in the authorization algorithm. Both authorization and tracking are supported in this paper.…”

Section: Performance Comparisonmentioning

confidence: 99%

See 1 more Smart Citation

Traceable Scheme of Public Key Encryption with Equality Test

Zhu

Xue

et al. 2022

Entropy

View full text Add to dashboard Cite

Public key encryption supporting equality test (PKEwET) schemes, because of their special function, have good applications in many fields, such as in cloud computing services, blockchain, and the Internet of Things. The original PKEwET has no authorization function. Subsequently, many PKEwET schemes have been proposed with the ability to perform authorization against various application scenarios. However, these schemes are incapable of traceability to the ciphertexts. In this paper, the ability of tracing to the ciphertexts is introduced into a PKEwET scheme. For the ciphertexts, the presented scheme supports not only the equality test, but also has the function of traceability. Meanwhile, the security of the proposed scheme is revealed by a game between an adversary and a simulator, and it achieves a desirable level of security. Depending on the attacker’s privileges, it can resist OW-CCA security against an adversary with a trapdoor, and can resist IND-CCA security against an adversary without a trapdoor. Finally, the performance of the presented scheme is discussed.

show abstract

Section: Performance Comparisonmentioning

confidence: 99%

“…In the same year, Lee et al proposed a new PKEwET scheme, from generic assumptions in the random oracle model [34]. To reduce the cost of computing and communication, Ling et al introduced the group mechanism into a PKEwET algorithm [35].…”

Section: Related Workmentioning

confidence: 99%

Traceable Scheme of Public Key Encryption with Equality Test

Zhu

Xue

et al. 2022

Entropy

View full text Add to dashboard Cite

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%

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

“…Tokens are generated by private key holders, and proxy can correctly perform equality test on ciphertext pairs only after obtaining corresponding tokens. is concept has been applied in a series of subsequent related works [4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

“…However, current PKEET definitions are not suitable for group granularity authorization in terms of efficiency [8]. Group public key encryption with equality test (G-PKEET) scheme is firstly proposed by Ling et al [7], which is the first PKEET scheme supporting group granularity authorization. Besides the concepts of "proxy" and "token," a trustable "group administrator" role is additionally introduced in G-PKEET, in charge of issuing tokens.…”

Section: Introductionmentioning

confidence: 99%

Group Public Key Encryption with Equality Test under Standard Model

Deng

Qian

2022

Security and Communication Networks

View full text Add to dashboard Cite

Group public key encryption with equality test (G-PKEET) scheme supports group granularity authorization on the equality test. An authorized proxy is able to check whether two ciphertexts belonging to the same group are encrypted from identical plaintext without decrypting them. However, in indistinguishability-based security notion, current existing PKEET and G-PKEET schemes do not allow adversary to invoke equality test as a service. In contrast, under practical circumstance, an adversary is probably able to exploit the equality test service offered by proxy to decipher a ciphertext, leading to unexpected and unwanted privacy leakage. In this paper, we propose a security definition that includes the abovementioned adversary ability. Through extending the functionality of current G-PKEET scheme, we design a concrete scheme that satisfies our new security definition. Furthermore, our G-PKEET scheme is the first G-PKEET scheme whose security properties can be proved under the standard model.

show abstract

Group public key encryption with equality test against offline message recovery attack

Cited by 30 publications

References 12 publications

Traceable Scheme of Public Key Encryption with Equality Test

Traceable Scheme of Public Key Encryption with Equality Test

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

Group Public Key Encryption with Equality Test under Standard Model

Contact Info

Product

Resources

About