Security analysis of the proposed scheme
The security of our improved scheme is based on Elliptic Curve Discrete Logarithm (ECDL) problem. We provide a formal security proof that our proposed signcryption scheme is UF-CMA secure against Type-I and Type-II attacker in the random oracle model under ECDL assumption.
Sep 7, 2017 · In this letter, we analyze the security of Yu et al.'s scheme and show that their scheme cannot withstand forgery attacks, namely, a malicious ...
Unforgeability is an important security property in signcryption. Recently, Yu et al. proposed a pairing-free and secure certificateless signcryption scheme ...
Nov 15, 2022 · The proposed scheme is proved to achieve confidentiality and unforgeability with the random oracle model. The security analysis shows that the ...
Unforgeability is an important security property in signcryption. Recently, Yu et al. proposed a pairing-free and secure certificateless signcryption scheme ...
Sep 1, 2021 · 2) Compared with the existing CLSC schemes, ours has superior secure performance because it satisfies confidentiality, unforgeability, non- ...
This paper aims to present a new certificateless signcryption scheme that does not consider secure channel communication.
Apr 4, 2023 · To avoid complicated pairing operation and improve performance, Liu, . proposed a pairing-free certificateless signcryption scheme, and claims ...
In this paper, we devise a pairing-free and secure CLSC scheme based on the DL and CDH assumption, it is applicable to cyberspace security.
In this paper, we propose a new signcryption scheme in certificateless based framework and prove its security under the CDHP and ECDLP assumptions.