Abstract
Presentation of a Two-Party Key Agreement Protocol based on Chaos
Highlights
A key agreement protocol is a protocol that used to build secret session keys by two or more communication parties, but no party can predetermine the resulting session key
Because of Chebyshev map's manifest feature as sensitive dependence on initial conditions/parameters and likeness to random behavior, this map is a chaotic map which has been used for symmetric encryption schemes, hash functions, public key encryption schemes and key agreement protocols
We will point out that Lee et al.'s protocol suffers from insufficiency of resisting the privileged insider attack and denial of service attack, insufficiency of providing anonymity, the high cost due to the using of smart cards and requiring synchronization
Summary
A key agreement protocol is a protocol that used to build secret session keys by two or more communication parties, but no party can predetermine the resulting session key. In 2011, Yoon and Jeon [14] proved that Wang-Zhao's protocol still requires timestamp information, and is vulnerable to illegal message modification attacks and proposed an efficient and secure key agreement protocol. In various scenarios such as e-commerce, e-banking and telecare information systems, users want to obtain services anonymously. We will point out that Lee et al.'s protocol suffers from insufficiency of resisting the privileged insider attack and denial of service attack, insufficiency of providing anonymity, the high cost due to the using of smart cards and requiring synchronization To overcome these problems, we introduce an improved key agreement protocol based on chaotic maps. Preliminaries we introduce concepts used in our protocol, such as Chebyshev chaotic map and Logistic chaotic map
Sign-in/Register to view highlights & summary 
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call