Efficient ID-based group key agreement with bilinear maps

Kyu Young Choi, Jung Yeon Hwang, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingChapter

102 Citations (Scopus)

Abstract

In modern collaborative and distributed applications, authenticated group key agreement (GKA) is one of important issues. Recently identity (ID)-based authenticated GKA has been increasingly researched because of the simplicity of a public key management. In this paper, we present a formal treatment on ID-based authenticated GKA, which extends the standard GKA model. We present two GKA protocols which use a bilinear-based cryptography: one is a bilinear variant of Burmester and Desmedt protocol [13] and the other is ID-based authenticated protocol based on the former protocol. Our protocols are scalable and 2-round protocols with forward secrecy. In particular, the ID-based authenticated GKA protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously and improves computational efficiency. We then prove their securities under the decisional bilinear DH and computational DH assumptions.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFeng Bao, Robert Deng, Jianying Zhou
PublisherSpringer Verlag
Pages130-144
Number of pages15
ISBN (Print)3540210180, 9783540210184
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2947
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient ID-based group key agreement with bilinear maps'. Together they form a unique fingerprint.

  • Cite this

    Choi, K. Y., Hwang, J. Y., & Lee, D. H. (2004). Efficient ID-based group key agreement with bilinear maps. In F. Bao, R. Deng, & J. Zhou (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 130-144). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2947). Springer Verlag. https://doi.org/10.1007/978-3-540-24632-9_10