A Secure and Efficient Three-Pass Authenticated Key Agreement Protocol Based on Elliptic Curves

Lim, Meng-Hui; Yeoh, Chee-Min; Lee, Sang-Gon; Lim, Hyotaek; Lee, Hoon Jae

doi:10.1007/978-3-540-79549-0_15

Cited by 9 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Three-pass protocol: One of the most interesting classical cryptographic protocols is three-pass protocol (Massey, 1988). After that the protocol used in many application (Uchoa et al, 2007;Lim et al, 2008;Abdullah et al, 2015). The protocol declares that privacy can be obtained with no advance distribution of the secret keys or public keys.…”

Section: Methodsmentioning

confidence: 99%

Implementation Three Pass Protocol on Multiplicative Cipher

Khalaf¹,

Ridha²,

Al-Wahab³

et al. 2020

J. Eng. Appl. Sci.

View full text Add to dashboard Cite

A three-pass protocol one of the frameworks in cryptography that provides privacy and multiplicative cipher is one of the traditional cryptographic algorithms that based on symmetric key encryption algorithms. In this research, we used the three-pass protocol method with the multiplicative cipher by combine them, this combination allows the sender and the receiver to exchange and distribute encryption key securely, hence, they don't need to send the key because each of them using its personal key for the message encryption and decryption process, so, the security of the multiplicative cipher improved.

show abstract

Section: Methodsmentioning

confidence: 99%

Implementation Three Pass Protocol on Multiplicative Cipher

Khalaf¹,

Ridha²,

Al-Wahab³

et al. 2020

J. Eng. Appl. Sci.

View full text Add to dashboard Cite

show abstract

“…Over the years, many AKA protocols have been proposed. However, most of the previous AKA protocols were constructed over either conventional public-key cryptography (PKC) [4,11,13,20,25] or identity-based cryptography (IBC) [5-7, 36, 41, 44]. It is wellknown that conventional PKC suffers from the heavy certificate management problem while IBC has the key escrow and key distribution problems.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Certificate-Based Authenticated Key Agreement Protocol without Bilinear Pairing

Zhang

et al. 2017

ITC

View full text Add to dashboard Cite

An authenticated key agreement (AKA) protocol is extremely essential to secure communications over insecure public networks. It enables the communication parties to securely set up a shared session key in present of the malicious attackers. Certificate-based cryptography (CBC) is a novel public-key cryptographic primitive that has many attractive merits. It solves the certificate revocation problem in conventional public-key cryptography and the key-escrow problem in identity-based cryptography. Until now, four AKA protocols have been proposed in the setting of CBC. However, all of them adopt the costly bilinear pairings and are not suitable for the devices which have limited computing resources and battery power. Therefore, it is interesting and worthwhile to design a certificate-based AKA protocol without using the bilinear pairings. In this paper, we develop a pairing-free certificate-based AKA protocol. The proposed protocol is proven secure under the classic computational Diffie-Hellman assumption in the random oracle model. Compared with the previous pairing-based certificate-based AKA protocols, the proposed protocol enjoys obvious advantage in the computation efficiency.

show abstract

“…Most of these protocols are password based where a directed dictionary attack can almost always succeed to break the password. To overcome this problem, ECC based authenticated key agreement protocol in wireless network are discussed in [7][8][9][10]. These protocols utilize ECDSA signature technique which enhances the security level of user authentication and key exchange.…”

Section: Introductionmentioning

confidence: 99%

Performance Study of genus 3 Hyperelliptic Curve Cryptosystem

Gupta¹,

Де²,

Chatterjee³

2012

Journal of Information Processing Systems

View full text Add to dashboard Cite

Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.

show abstract

A Secure and Efficient Three-Pass Authenticated Key Agreement Protocol Based on Elliptic Curves

Cited by 9 publications

References 19 publications

Implementation Three Pass Protocol on Multiplicative Cipher

Implementation Three Pass Protocol on Multiplicative Cipher

An Efficient Certificate-Based Authenticated Key Agreement Protocol without Bilinear Pairing

Performance Study of genus 3 Hyperelliptic Curve Cryptosystem

Contact Info

Product

Resources

About