Sustained and Authenticated of a Universal Construction for Multiple Key Agreement Based on Chaotic Maps with Privacy Preserving

Abstract

Authenticated multiple key agreement protocols allow two parties to generate multi-session keys in one session, which will be used for future secure communications in public network. The article proposes a provably secure sustained and authenticated multiple key establishment protocol based on a universal construction. Security of the protocol is based on the computational infeasibility of solving Chaotic Maps-Based Discrete Logarithm problem, Chaotic Maps-Based Diffie-Hellman problem and a secure symmetric encryption. Our proposed protocol can transmit m+n secret shadows based on public key system with chaotic maps, which will produce mn session keys to be used for future with privacy preserving and non-interactive in each independent communication that will be much more efficient than others related schemes. At the same time our proposed protocol can not only refrain from consuming modular exponential computing and scalar multiplication on an elliptic curve, but is also robust to resist various attacks and achieves perfect forward secrecy with adjusting m and n to adapt different environment.