Group key agreement is an important security mechanism for distributed
communications, in which it can provide a speciﬁc environment for people located at
diﬀerent places to contribute each one’s secret to establish a ﬁnal session key over an
insecure channel. Recently, Guo and Zhang proposed a new protocol that satisﬁed the
requirements of a group key agreement in terms of a chaotic cryptosystem. However, Guo
and Zhang’s protocol cannot comply with the mechanism for group key agreement even if it
has a contributory nature inside, and it cannot protect the security when oﬀ-line guessing
attacks occur. To overcome these drawbacks, we propose a novel, practical protocol that
meets the realistic requirements of group key agreement based on Chebyshev chaotic maps
and resists several types of attacks. We believe that our proposed protocol is eﬃcient,
secure, and suitable for distributed networks for collaborative group communications.
International Journal of Innovative Computing Information and Control, V.9 N.5 : 1935–1949.