کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
392081 | 664662 | 2015 | 27 صفحه PDF | دانلود رایگان |
• An efficient and secure ECM-3PAKE protocol with key confirmation is proposed.
• The proposed protocol is designed using extended chaotic maps and smartcard.
• The proposed protocol is provably secure in the random oracle model.
• The results of AVISPA show that our protocol resists active and passive attacks.
• The protocol is secure and computation efficient than the existing protocols.
Recently, the theory and application of Chebyshev polynomials have been studied extremely by the cryptographic research community; many symmetric and asymmetric cryptographic protocols have been designed based on extended chaotic maps. In this paper, a computation cost efficient and robust three party password-based authenticated key exchange (ECM-3PAKE) protocol with key confirmation has been designed using extended chaotic maps and smartcard. In this protocol, two users can establish a common session key with the help of a trusted server. The proposed protocol is shown to be provably secure in the random oracle model and formally validated through the simulation of Automated Validation of Internet Security Protocols and Applications (AVISPA) software. The simulation results from different model checkers of AVISPA proved that the protocol can withstand the active and passive attacks. Besides, the informal security analysis gives the evidence of security and functional efficiencies of the protocol. In addition, the comparative analysis illustrates that the protocol performs better than the existing protocols.
Journal: Information Sciences - Volume 312, 10 August 2015, Pages 104–130