International Association for Cryptologic Research
In this paper, the authors have proposed an efficient group key agreement scheme for mobile ad hoc networks. The scheme is efficient as only one bilinear computation is required for group members to obtain the session key. The scheme is analyzed for security without random oracle model. However, they prove that their scheme is not secure. In particular, they show that any passive adversary (or non-group member) can compute the session key without having access to the individual secret keys of the group members.