TY - JOUR
T1 - Provably secure three-party key agreement protocol using Chebyshev chaotic maps in the standard model
AU - Lai, Hong
AU - Orgun, Mehmet A.
AU - Xiao, Jinghua
AU - Pieprzyk, Josef
AU - Xue, Liyin
AU - Yang, Yixian
PY - 2014/9
Y1 - 2014/9
N2 - Recently, several key agreement protocols based on Chebyshev chaotic maps have been proposed in the literature. However, they can normally achieve "heuristic" security, that is, once drawbacks are found in these protocols, they are either modified to resist the new attacks, or are discarded. Under these circumstances, it is necessary and significant to define standard security models that can precisely characterize the capabilities of the participants and a potent adversary. Hence, we propose to use public key encryption based on enhanced Chebyshev chaotic maps and pseudo-random function ensembles to construct an efficient three-party key agreement protocol under the standard model, in which the adversary is able to make a wider range of queries and have more freedom than the other proposed schemes. In the design of our protocol, we follow the ideas in the recent key agreement protocol of Yang and Cao's. The proposed protocol is shown to be provably secure if decisional Diffie-Hellman problem, which is based on Chebyshev chaotic maps, is computationally infeasible. To the best of our knowledge, our protocol is the first provably secure 3PAKE protocol using Chebyshev chaotic maps under the standard model.
AB - Recently, several key agreement protocols based on Chebyshev chaotic maps have been proposed in the literature. However, they can normally achieve "heuristic" security, that is, once drawbacks are found in these protocols, they are either modified to resist the new attacks, or are discarded. Under these circumstances, it is necessary and significant to define standard security models that can precisely characterize the capabilities of the participants and a potent adversary. Hence, we propose to use public key encryption based on enhanced Chebyshev chaotic maps and pseudo-random function ensembles to construct an efficient three-party key agreement protocol under the standard model, in which the adversary is able to make a wider range of queries and have more freedom than the other proposed schemes. In the design of our protocol, we follow the ideas in the recent key agreement protocol of Yang and Cao's. The proposed protocol is shown to be provably secure if decisional Diffie-Hellman problem, which is based on Chebyshev chaotic maps, is computationally infeasible. To the best of our knowledge, our protocol is the first provably secure 3PAKE protocol using Chebyshev chaotic maps under the standard model.
KW - Decisional Diffie-Hellman
KW - Enhanced Chebyshev chaotic maps
KW - Heuristic security
KW - Pseudo-random function ensembles
KW - Standard model
UR - http://www.scopus.com/inward/record.url?scp=84901574009&partnerID=8YFLogxK
U2 - 10.1007/s11071-014-1388-z
DO - 10.1007/s11071-014-1388-z
M3 - Article
AN - SCOPUS:84901574009
SN - 0924-090X
VL - 77
SP - 1427
EP - 1439
JO - Nonlinear Dynamics
JF - Nonlinear Dynamics
IS - 4
ER -