A Review of Elliptic Curve based Signcryption Schemes

Singh, Anuj Kumar

doi:10.5120/17821-8769

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In I997, Zheng developed an algorithm that performs the functionalities of both encryption and signatures together in a single process and termed it as signcryption [25]. The revolutionary algorithm saves up to 50% computational cost and 85% bandwidth cost in comparison to previously proposed signthen-encrypt or encrypt-then-sign techniques [26]. The working of the algorithm is based on the idea of a public-key cryptosystem (PKC) [27].…”

Section: Related Workmentioning

confidence: 99%

Cost-Effective Signcryption for Securing IoT: A Novel Signcryption Algorithm Based on Hyperelliptic Curves

Khan,

Zhu,

Ali

et al. 2024

Information

View full text Add to dashboard Cite

Security and efficiency remain a serious concern for Internet of Things (IoT) environments due to the resource-constrained nature and wireless communication. Traditional schemes are based on the main mathematical operations, including pairing, pairing-based scalar multiplication, bilinear pairing, exponential operations, elliptic curve scalar multiplication, and point multiplication operations. These traditional operands are cost-intensive and require high computing power and bandwidth overload, thus affecting efficiency. Due to the cost-intensive nature and high resource requirements, traditional approaches are not feasible and are unsuitable for resource-limited IoT devices. Furthermore, the lack of essential security attributes in traditional schemes, such as unforgeability, public verifiability, non-repudiation, forward secrecy, and resistance to denial-of-service attacks, puts data security at high risk. To overcome these challenges, we have introduced a novel signcryption algorithm based on hyperelliptic curve divisor multiplication, which is much faster than other traditional mathematical operations. Hence, the proposed methodology is based on a hyperelliptic curve, due to which it has enhanced security with smaller key sizes that reduce computational complexity by 38.16% and communication complexity by 62.5%, providing a well-balanced solution by utilizing few resources while meeting the security and efficiency requirements of resource-constrained devices. The proposed strategy also involves formal security validation, which provides confidence for the proposed methodology in practical implementations.

show abstract

Section: Related Workmentioning

confidence: 99%

Cost-Effective Signcryption for Securing IoT: A Novel Signcryption Algorithm Based on Hyperelliptic Curves

Khan,

Zhu,

Ali

et al. 2024

Information

View full text Add to dashboard Cite

show abstract

“…On the other hand, many pairing free signcryption schemes based on elliptic curve cryptography (ECC) without the specific condition of ID based authentication can also be found in literature, see survey [16]. In these schemes, the guarantee that a given public key belongs to a certain user is explicitly assumed, for instance by a third party who is checking the integrity of the stored public key and identity data.…”

Section: Related Workmentioning

confidence: 99%

“…As a consequence, the proposed schemes represent the most efficient anonymous signcryption schemes. In order to do a fair comparison with the most efficient one in the state of the art, ASEC [16], we consider the certificate based schemes using the ECQV implicit certificates with the assumption that the public keys are generated offline. Note that in ASEC also the assumption has been made that the validity of the public key is obtained offline, by the storage in a third party protected environment.…”

Section: Anonymous Signcryptionmentioning

confidence: 99%

Pairing Free Certificate Based Signcryption Schemes Using ECQV Implicit Certificates

2019

KSII TIIS

View full text Add to dashboard Cite

Signcryption schemes offer the possibility to simultaneously sign and encrypt a message. In order to guarantee the authentication of both signer and receiver in the most efficient way during the signcryption, certificate based solutions have been proposed in literature. We first compare into detail three recently proposed certificate based signcryption systems relying on the elliptic curve discrete logarithm problem and without the usage of compute intensive pairing operations. Next, we demonstrate how the performance of these certificate based systems can be improved by using the Elliptic Curve Qu Vanstone (ECQV) implicit certificates. What is more, generalized signcryption schemes are easily derived from these schemes and the anonymity feature of sender and receiver is already inherently included or can be very efficiently obtained without a significant additional cost.

show abstract

An Improved E-Payment System and Its Extension to a Payment System for Visually Impaired and Blind People with User Anonymity

Braeken

2017

Wireless Pers Commun

View full text Add to dashboard Cite

A Review of Elliptic Curve based Signcryption Schemes

Cited by 6 publications

References 15 publications

Cost-Effective Signcryption for Securing IoT: A Novel Signcryption Algorithm Based on Hyperelliptic Curves

Cost-Effective Signcryption for Securing IoT: A Novel Signcryption Algorithm Based on Hyperelliptic Curves

Pairing Free Certificate Based Signcryption Schemes Using ECQV Implicit Certificates

An Improved E-Payment System and Its Extension to a Payment System for Visually Impaired and Blind People with User Anonymity

Contact Info

Product

Resources

About