Paper 2015/177

On the Security of an Efficient Group Key Agreement Scheme for MANETs

Purushothama B R and Nishat Koti

Abstract

Yang et al. have proposed an efficient group key agreement scheme for Mobile Adhoc 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, we prove that their scheme is not secure. In particular, we 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. Hence, Yang et al. scheme cannot be used for secure group communication. We also show that, the scheme cannot be used for secure group communication unless there exists a central entity, and hence cannot be used for secure communication in mobile adhoc networks.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
key management
Contact author(s)
puru @ nitgoa ac in
History
2015-03-01: received
Short URL
https://ia.cr/2015/177
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/177,
      author = {Purushothama B R and Nishat Koti},
      title = {On the Security of an  Efficient Group Key Agreement Scheme for  {MANETs}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/177},
      year = {2015},
      url = {https://eprint.iacr.org/2015/177}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.