An Efficient and Secure Key Agreement Protocol Preserving User Anonymity Under Chebyshev Chaotic Maps

摘要

A type of key agreement protocol based on chaotic maps was proposed in 2009. Soon after the proposal, it was analyzed and improved. Unfortunately, there are still two weaknesses in the two improved protocols. To strengthen the performance of the focused type of protocol, a new improved protocol based on Niu et al.'s protocol is proposed in this paper. Theoretical analysis shows that our improved protocol is immune to denied of service attacks through the keyed hashed digests with either the secret key or the session key. Moreover, modified protocol is more cost-efficient by shifting most computations from on-line to off-line.