An Elliptic Curve Signcryption Scheme and Its Application

Zhang, Ping; Li, Yamin; Chi, Huanhuan

doi:10.1155/2022/7499836

Cited by 6 publications

(2 citation statements)

References 31 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let's say: 𝐴 generates 𝑑 𝐴 as the private key 𝑎𝑛𝑑 𝐵 generates 𝑑 𝐵 , too. Then both compute their 𝑝𝑢𝑏𝑙𝑖𝑐 𝑘𝑒𝑦𝑠 𝑄 𝐴 (𝑥, 𝑦), 𝑄 𝐵 (𝑥, 𝑦) that is a product of [3]:…”

Section: Elliptic Curve Diffie-hellman (Ecdh) Key Exchangementioning

confidence: 99%

“…ECC provides the same security level with a small key size, lower resource consumption, and faster computation [2]. ECC offers multiple security solutions, such as public key encryption and decryption algorithms; digital signature certificates by the Elliptic Curve Digital Signature Algorithm (ECDSA); and (what is in the scope of the paper) a key agreement protocol by the ECDH algorithm [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

IoT-Key Agreement Protocol Based on The Lowest Work-Load Versions of The Elliptic Curve Diffie-Hellman

Oudah,

Maolood

2023

Iraqi Journal of Science

View full text Add to dashboard Cite

A key agreement protocol (KAP) is a fundamental block in any cryptosystem since it ensures secure communication between two parties. Furthermore, KAP should include advanced features in limited-resource environments such as IoT, in which this protocol must be lightweight and efficient in consuming resources. Despite the Elliptic Curve Diffie-Hellman (ECDH) algorithm having often been considered efficient in providing an acceptable security degree with less resource consumption, it has suffered from weakness against Man-In-The-Middle Attacks (MITMA). This paper presents two versions of the Variant Elliptic Curve Diffie-Hellman (VECDH) algorithms as a key agreement protocol. The security analysis indicates that the proposed algorithm could be more robust compared to the MITMA, in addition to several security features. The proposed algorithms scale down the computation complexity by decreasing the arithmetic operations, to make the algorithms the lowest workload and suitable for application in restricted resource environments.

show abstract

Section: Elliptic Curve Diffie-hellman (Ecdh) Key Exchangementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

IoT-Key Agreement Protocol Based on The Lowest Work-Load Versions of The Elliptic Curve Diffie-Hellman

Oudah,

Maolood

2023

Iraqi Journal of Science

View full text Add to dashboard Cite

show abstract

An investigating study of blind and ID-based signcryption schemes for misuse risk protection and high performance computing

Ullah¹,

Jiangbin²,

Hussain³

et al. 2023

Cluster Comput

View full text Add to dashboard Cite

Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography

Namous,

Habib,

Khalaf

2024

BIO Web Conf.

View full text Add to dashboard Cite

In this paper, we propose a new algorithm to improve the security of the Elliptic Curve Cryptography algorithm, ECC, using the Rosenberg-Strong pairing function. In the proposed algorithm, the Rosenberg-Strong pairing function is applied to the EEC to convert the two ciphertexts (two points on the elliptic curve) to only one ciphertext (one point on the elliptic curve). That is, only one ciphertext is transmitted in the proposed algorithm leading to less transmitting time compared with the classical EEC. The analysis of security illustrates that the proposed algorithm is secure against the attacks of the most common attacking algorithms. Therefore, using the proposed algorithm reduces the transmitting time and provides a high-security level. Thus, the proposed algorithm is secure and efficient, and it provides less transmitting time compared with the classical ECC.

show abstract

An Elliptic Curve Signcryption Scheme and Its Application

Cited by 6 publications

References 31 publications

IoT-Key Agreement Protocol Based on The Lowest Work-Load Versions of The Elliptic Curve Diffie-Hellman

IoT-Key Agreement Protocol Based on The Lowest Work-Load Versions of The Elliptic Curve Diffie-Hellman

An investigating study of blind and ID-based signcryption schemes for misuse risk protection and high performance computing

Constructing a Cryptosystem Algorithm by Applying the Rosenberg-Strong Pairing Function on the Elliptic Curve Cryptography

Contact Info

Product

Resources

About