Constant-round authenticated group key exchange for dynamic groups

Hyun Jeong Kim, Su Mi Lee, Dong Hoon Lee

Research output: Contribution to journalArticle

87 Citations (Scopus)

Abstract

An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member's delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations.

Original languageEnglish
Pages (from-to)245-259
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3329
Publication statusPublished - 2004 Dec 1

Fingerprint

Key Exchange
Ad hoc networks
Trustees
Modular Exponentiation
Key Management
Ad Hoc Networks
Join

Keywords

  • Ad hoc networks
  • Dynamic authenticated group key exchange

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{338b326158574560bdd6053238898c32,
title = "Constant-round authenticated group key exchange for dynamic groups",
abstract = "An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member's delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations.",
keywords = "Ad hoc networks, Dynamic authenticated group key exchange",
author = "Kim, {Hyun Jeong} and Lee, {Su Mi} and Lee, {Dong Hoon}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3329",
pages = "245--259",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Constant-round authenticated group key exchange for dynamic groups

AU - Kim, Hyun Jeong

AU - Lee, Su Mi

AU - Lee, Dong Hoon

PY - 2004/12/1

Y1 - 2004/12/1

N2 - An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member's delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations.

AB - An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptographic goals. In the paper, we study AGKE schemes for dynamically changing groups in ad hoc networks, i.e., for environments such that a member of a group may join and/or leave at any given time and a group key is exchanged without the help of any central sever. Difficulties in group key managements under such environments are caused by dynamically changing group and existence of no trustee. In most AGKE schemes proposed so far in the literature, the number of rounds is linear with respect to the number of group members. Such schemes are neither scalable nor practical since the number of group members may be quite large and the efficiency of the schemes is severely degraded with only one member's delay. We propose an efficient provably secure AGKE scheme with constant-round. The propose scheme is still contributory and efficient, where each user executes three modular exponentiations and at most O(n) XOR operations.

KW - Ad hoc networks

KW - Dynamic authenticated group key exchange

UR - http://www.scopus.com/inward/record.url?scp=35048821512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048821512&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048821512

VL - 3329

SP - 245

EP - 259

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -