期刊
NONLINEAR DYNAMICS
卷 81, 期 4, 页码 2071-2078出版社
SPRINGER
DOI: 10.1007/s11071-015-2126-x
关键词
Chebyshev chaotic maps; Network protocols; Authentication; Network security
资金
- Ministry of Science and Technology of the Republic of China, Taiwan [MOST 103-2221-E-320 -003, TCRPP103008]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据