Efficient ID-based authenticated group key agreement from bilinear pairings

Lan Zhou, Willy Susilo, Yi Mu

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

15 Citations (Scopus)


The nature of mobile ad-hoc networks does not permit a member of the group or a central authority to determine a single key to be used among the group members. Group key agreement offers a solution to this problem by allowing the group members to collaboratively determine the common key for the group. Additionally, authenticated group key agreement (AGKA) is an important issue in many modern collaborative and distributed applications. During the last few years, a number of authenticated group key agreement protocols have been proposed in the literature. In this paper, we present a secure ID-based AGKA protocol which only requires one round by using pairing-based cryptography. We prove that the scheme is secure against an active adversary under the decisional bilinear Diffie-Hellman assumption in the Random Oracle Model. We then extend our scheme to a two-round AGKA protocol which is more efficient in communication costs, and this scheme outperforms any existing AGKA protocols in the literature.

Original languageEnglish
Title of host publicationMobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages12
Volume4325 LNCS
ISBN (Print)3540499326, 9783540499329
Publication statusPublished - 2006
Event2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006 - Hong Kong, China
Duration: 13 Dec 200615 Dec 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4325 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006
CityHong Kong


  • Authenticated group key agreement
  • Bilinear pairings
  • Cryptography
  • ID-based


Dive into the research topics of 'Efficient ID-based authenticated group key agreement from bilinear pairings'. Together they form a unique fingerprint.

Cite this