Cryptanalysis and improvement of a three-party key agreement protocol using enhanced Chebyshev polynomials

Zhao, Fengjun; Gong, Peng; Li, Shuai; Li, Mingguan; Li, Ping

doi:10.1007/s11071-013-0979-4

Cited by 55 publications

(79 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 1 lists the performance comparisons of the related protocols [16][17][18][19][20]25] and the proposed 3PKAP protocol, where T c denotes the time of executing a Chebyshev polynomial operations; T s denotes the time of executing a symmetric encryption/decryption operation; T sq denotes the time of executing a squaring operation; and T sr denotes the time of executing a squaring root solving operation, and T h denotes the time of executing a one-way hash function operation, respectively.…”

Section: Ake Security For the 3pkap Protocolmentioning

confidence: 99%

“…Both the protocol of Table 1 Performance comparisons with related protocols Protocols Lai et al [16] Zhao et al [17] Lee et al [18] Xie et al [19] Hu-Zhang [20] Farash-Attari [25] Proposed pro- Lee et al [18] and the protocol of Hu and Zhang [20] only require four messages. The proposed protocol only requires four messages and three rounds.…”

Section: Performance Analyses and Comparisonsmentioning

confidence: 99%

“…For example, Lai et al [16] in 2012 proposed a chaotic mapbased three-party EKE protocol which protects users' passwords by using server's public-key and symmetric cryptosystems. Later, Zhao et al [17] s protocols stored sensitive information by using smartcards. That is, their protocols require extra equipment for storing secret keys.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Provably secure extended chaotic map-based three-party key agreement protocols using password authentication

Lee

Lin

et al. 2015

Nonlinear Dyn

View full text Add to dashboard Cite

This paper presents a novel three-party key agreement protocol using password authentication, which enables each client sharing a long-lived secret only with a trusted server to exchange confidential and authenticated information with another client over an insecure network via the server. The proposed protocol is based on extended chaotic maps and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server such that the numbers of transmissions are reduced. A round-efficient version of the proposed key agreement protocol is also described. Compared to related chaotic map-based approaches, the proposed protocol not only possesses higher security and lower computational cost, but also has fewer transmissions. Additionally, the proposed protocol is proven secure in the random oracle model and realizes optimal in communications.

show abstract

Section: Ake Security For the 3pkap Protocolmentioning

confidence: 99%

Section: Performance Analyses and Comparisonsmentioning

confidence: 99%

See 1 more Smart Citation

Provably secure extended chaotic map-based three-party key agreement protocols using password authentication

Lee

Lin

et al. 2015

Nonlinear Dyn

View full text Add to dashboard Cite

show abstract

“…(9) Resisting intruder-in-the-middle attacks An adversary attempting to interrupt messages and to substitute them with his/her own messages such that the communication parties compute the wrong session key can be detected since the hash values μ AS and μ S A provide mutual authentication of S and A, μ BS and μ S B provide mutual authentication of S and B, and μ AB and μ B A provide mutual authentication of A and B, Therefore, the proposed protocol is secure against intruder-in-themiddle attacks. Table 2 compares the performance measures of the proposed protocol with those of related three-party authenticated key agreement protocols [34][35][36][37][38][39][40]. The first comparison item is modular exponential operations, where C denotes the time of executing a Chebyshev polynomial operation.…”

Section: Security Analysesmentioning

confidence: 99%

“…Lai et al [34] in 2012 proposed an enhanced chaotic mapbased three-party authenticated key agreement protocol which uses symmetric cryptosystems. Later, Zhao et al [35] proposed an alternative protocol to address the weaknesses of the Lai et al's protocol. Additionally, Lee et al [36], Xie et al [37] in 2013 and Hu and Zhang [38] developed extended chaos-based threeparty authenticated key agreement protocols that used server public keys and symmetric cryptosystems to reduce transmissions and improve security.…”

Section: Introductionmentioning

confidence: 99%

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

Lee

2015

Nonlinear Dyn

View full text Add to dashboard Cite

An efficient and secure three-party authenticated key agreement protocol is proposed to enable two users to establish a common secret key for exchanging confidential and authenticated information with the help of a trusted server. The proposed protocol only employs extended chaotic maps and hash operations, i.e., it does not require a server public key, symmetric cryptosystems, time-consuming modular exponential computations, or time-consuming modular exponential computations and scalar multiplications on elliptic curve. A round-efficient version of the proposed protocol is also implemented by rearranging and sending the messages in parallel. The session security of the proposed protocol is based on the Chebyshev chaotic map-based Diffie-Hellman assumption. Compared to related chaotic map-based approaches, the proposed protocol not only requires lower computational cost, but also has fewer transmissions.

show abstract

Lightweight privacy‐aware secure authentication scheme for cyber‐physical systems in the edge intelligence era

Deebak

Al‐Turjman²

2021

Concurrency and Computation

View full text Add to dashboard Cite

Internet of Things (IoT) and cyber‐physical systems demand proper real‐time data processing and analysis to fulfill the essential characteristics of seamless computing services such as less processing time, dynamic network management, and location awareness. With the evolution of mobile edge computing, numerous security and privacy issues have been addressed including policy management, authentication, access control, and confidentiality. The technologies such as big‐data, Internet of Things, and cloud have improved the development of modern healthcare systems to improve the quality of medical services. It is nowadays integrating the computing methods and communication technologies such as wireless sensor networks, radio frequency identification, smartphones, and location awareness to collect and analyze the physiological data of the patient. The e‐Health entities such as medical device, client, and server rely on analytical models to carry out early diagnosis and remote monitoring. As it is based on e‐Health applications, a real‐time healthcare system is preferred to integrate with mobile cloud computing. Since the medical data are hugely exposed to vulnerabilities, a lightweight privacy‐aware secure authentication (LPASA) scheme is presented. To achieve better secure efficiencies, this article is preferable to use lightweight cryptographic operations, namely, one‐way hashing function and bitwise exclusive‐OR. Moreover, the formal and informal security analysis shows that the proposed LPASA can withstand the possible active and passive attacks such as replay, man‐in‐the‐middle, privileged‐insider, online‐guessing, and so forth. The experimental analysis demonstrates that the proposed LPASA scheme achieves a better quality of services in terms of packet delivery ratio, energy consumption per data delivery bit, and percentage of packets with low latency to adopt in resource‐constrained environments.

show abstract

Cryptanalysis and improvement of a three-party key agreement protocol using enhanced Chebyshev polynomials

Cited by 55 publications

References 25 publications

Provably secure extended chaotic map-based three-party key agreement protocols using password authentication

Provably secure extended chaotic map-based three-party key agreement protocols using password authentication

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

Lightweight privacy‐aware secure authentication scheme for cyber‐physical systems in the edge intelligence era

Contact Info

Product

Resources

About