Efficient three-party authenticated key agreements based on Chebyshev chaotic map-based Diffie–Hellman assumption

Lee, Tian-Fu

doi:10.1007/s11071-015-2126-x

Cited by 9 publications

(4 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2008, Zhang [10] enhanced Chebyshev polynomials and proved that the semi-group property and the commutative under composition hold on the interval (−∞,+∞). Accordingly,…”

Section: Enhanced Chebyshev Chaotic Mapsmentioning

confidence: 99%

“…Recent research has shown that cryptosystems using operations based on Chebyshev chaotic maps are more efficient than traditional cryptosystems using modular exponential computation and scalar multiplication on elliptic curves [8][9][10]. However, in 2005, Bergamo et al [11] showed that public-key cryptosystems based on Chebyshev polynomials fail to exhibit the contributory property of key agreements.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Extended Chaotic Map-Based IBE for Industrial Environment

Lee

Huang

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

Identity-based encryption is a public key-based method of encryption that enables communicating identities to use some individual and unique information, such as their physical IP addresses and MAC addresses, to identify them and as public keys. The scheme does not require the extra device to store long-term public keys. So, it is convenient for use in practical applications, including smart industry and smart manufacturing. This study develops a novel, efficient, and secure identity-based encryption scheme using an extended Chebyshev chaotic map that does not require time-consuming modular exponential computations or scalar multiplications on elliptic curves. Cryptography that is based on chaotic maps has recently been demonstrated to outperform traditional cryptography. Besides demonstrating that the proposed scheme satisfies the security requirements of identity-based encryption, the simulation results of this study show that the proposed scheme requires less response time than related identity-based encryption schemes. Due to hardware limitations, not all industrial devices can load heavy computations. Therefore, the proposed identity-based encryption scheme outperforms related identity-based encryption approaches, and is suitable for industrial environment.

show abstract

“…In 2008, Zhang [10] enhanced Chebyshev polynomials and proved that the semi-group property and the commutative under composition hold on the interval (−∞,+∞). Accordingly,…”

Section: Enhanced Chebyshev Chaotic Mapsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Extended Chaotic Map-Based IBE for Industrial Environment

Lee

Huang

2022

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…In 2008, in order to enhance the property of the Chebyshev chaotic maps, Zhang [ 42 ] proved that the semi-group property holds for Chebyshev polynomials [ 43 ] defined over the interval (−∞, +∞), and Chebyshev chaotic maps based key exchange schemes were widely used in the 3PAKE protocol. Chebyshev chaotic maps based scheme has advantages such as high safety, low computational cost, simple encryption, small storage capacity requirement, and low bandwidth [ 37 , 44 , 45 ]. Therefore, compared to DH and ECC based scheme, Chebyshev chaotic maps based scheme is more suitable for the wireless sensor network and the authentication system using smart card.…”

Section: Introductionmentioning

confidence: 99%

Anonymity preserving and round effective three-party authentication key exchange protocol based on chaotic maps

Pak¹,

Pak²,

Ho³

et al. 2019

PLoS ONE

View full text Add to dashboard Cite

Three-party authentication key exchange (3PAKE) is a protocol that allows two users to set up a common session key with the help of a trusted remote server, which is effective for secret communication between clients in a large-scale network environment. Since chaotic maps have superior characteristics, researchers have recently presented some of the studies that apply it to authentication key exchange and cryptography. Providing user anonymity in the authentication key exchange is one of the important security requirements to protect users' personal secrets. We analyse Lu et al.'s scheme which attempts to provide user anonymity and we prove that his scheme has errors in the key exchange phase and password change phase. We propose a round-effective three-party authentication key exchange (3PAKE) protocol that provides user anonymity and we analyse its security properties based on BAN logic and AVISPA tool.

show abstract

“…Recently, a number of key agreement protocols based on chaotic maps were proposed, which have improved computational efficiency. Using Chebyshev chaotic maps has been shown to be more efficient than cryptography using modular exponential computations and scalar multiplications on elliptic curves [20][21][22][23][24][25][26][27][28][29]. However, Chebyshev chaotic maps and their enhancement are affected by the discrete logarithm problem and the Diffie-Hellman problem [30][31][32][33].…”

Section: Introductionmentioning

confidence: 99%

Light-Weighted Password-Based Multi-Group Authenticated Key Agreement for Wireless Sensor Networks

Chen¹,

Chang

Liu³

2019

Applied Sciences

View full text Add to dashboard Cite

Security is a critical issue for medical and health care systems. Password-based group-authenticated key agreement for wireless sensor networks (WSNs) allows a group of sensor nodes to negotiate a common session key by using password authentication and to establish a secure channel by this session key. Many group key agreement protocols use the public key infrastructure, modular exponential computations on an elliptic curve to provide high security, and thus increase sensor nodes’ overhead and require extra equipment for storing long-term secret keys. This work develops a novel group key agreement protocol using password authentication for WSNs, which is based on extended chaotic maps and does not require time-consuming modular exponential computations or scalar multiplications on an elliptic curve. Additionally, the proposed protocol is suitable for multiple independent groups and ensures that the real identities of group members cannot be revealed. The proposed protocol is not only more secure than related group key agreement protocols but also more efficient.

show abstract

Efficient three-party authenticated key agreements based on Chebyshev chaotic map-based Diffie–Hellman assumption

Cited by 9 publications

References 40 publications

Efficient Extended Chaotic Map-Based IBE for Industrial Environment

Efficient Extended Chaotic Map-Based IBE for Industrial Environment

Anonymity preserving and round effective three-party authentication key exchange protocol based on chaotic maps

Light-Weighted Password-Based Multi-Group Authenticated Key Agreement for Wireless Sensor Networks

Contact Info

Product

Resources

About