Anonymous ID-Based Group Key Agreement for Wireless Networks

Abstract

Popularity of group-oriented applications motivates research on security and privacy protection for group communications. A number of group key agreement protocols exploiting ID-based cryptosystem have been proposed for this objective. Though bearing beneficial features like reduced management cost, private key delegation from ID-based cryptosystem, they have not taken into account privacy issues during group communication. In wireless networks, the privacy problem becomes more crucial and urgent for mobile users due to the open nature of radio media. In this paper, we proposed an anonymous IDbased group key agreement protocol for wireless networks. Based on ID-based cryptosystem, our protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for mobile users. More important, in the proposed protocol, the computation cost for each group member is largely reduced to meet the computation capability restriction of mobile devices.

A Pairing Free Certificateless Group Key Agreement Protocol with Constant Round

“…But this protocol requires log n 2 rounds for n numbers of users. Since then, many ID-based group key exchange protocols [7], [10], [11] have been proposed.…”

Forward Secure ID-Based Group Key Agreement Protocol with Anonymity

“…Although the adversary reveals the private key S i , he cannot compute k i because computing r i r i+1 P given <P , r i P , r i+1 P > is hard problem under the ECDH assumption. Therefore, our Tables 1 and 2 show the comparison of Wan et al's protocols [7] and our proposed protocols in performance. We use the following notations:…”

“…In 2008, Wan et al [7] proposed an anonymous IDbased GKA protocol. Their protocol keeps the advantage of the ID-based cryptosystem and provides anonymity of the identities from outsiders.…”

“…However, identities of group members can be exposed in the ID-based GKA protocol, so eavesdroppers can easily learn who belongs to the specific group. Recently, Wan et al [7] proposed a solution for this problem, an anonymous ID-based GKA protocol, which can keep group members' anonymity to outside eavesdroppers; nevertheless, the protocol has some security flaws. This paper shows that Wan et al's GKA is insecure against colluding attack and their joining/leaving protocols do not guarantee forward and backward secrecy.…”

A dynamic ID-based authenticated group key exchange protocol without pairings

“…It utilized a binary key tree structure and achieves authentication with the ID-based cryptosystem, hence avoids management of certificates. Since then, many ID-based group key exchange protocols [7][8][9][10][11][12][13][14] using bilinear pairings have been proposed. All authors of the protocols above do not analyze whether their protocol can resist the attack of ephemeral private key revealing or not, and all these protocols utilize the bilinear pairings which have an expensive cost when computed.…”