An efficient dynamic group key agreement protocol for imbalanced wireless networks

Yun Hsin Chuang, Yuh-Min Tseng

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

Owing to the popularity of wireless networks, the group key agreement (GKA) design is critical for providing secure group communications over an insecure wireless channel. In 2005, Nam et al. proposed a GKA protocol for imbalanced wireless networks in which an imbalanced wireless network consists of many mobile nodes with limited computing capability and a powerful node with less restriction. In 2007, Tseng showed that Nam et al.'s protocol is not a contributory GKA, while he also proposed a new GKA protocol. However, neither GKA protocol is concerned with dynamic member joining/leaving. This is an important functionality of GKA, especially for a wireless network environment. In this paper, we propose a dynamic group key agreement protocol for imbalanced wireless networks, and show that it requires less computation cost for dynamic member joining/leaving as compared to the previously proposed protocols. We also show that the proposed protocol is provably secure against passive attacks under the decision Diffie-Hellman problem and the hash function assumptions. Furthermore, by the pre-shared two-party key between a mobile node and the powerful node in the existing imbalanced wireless networks, we propose a generalized GKA protocol that requires only several hash functions.

Original languageEnglish
Pages (from-to)167-180
Number of pages14
JournalInternational Journal of Network Management
Volume20
Issue number4
DOIs
Publication statusPublished - 2010 Jul 1

Fingerprint

Wireless networks
Network protocols
Hash functions
Joining
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Computer Networks and Communications

Cite this

@article{a52a35915d004a07818f85fc283f3d29,
title = "An efficient dynamic group key agreement protocol for imbalanced wireless networks",
abstract = "Owing to the popularity of wireless networks, the group key agreement (GKA) design is critical for providing secure group communications over an insecure wireless channel. In 2005, Nam et al. proposed a GKA protocol for imbalanced wireless networks in which an imbalanced wireless network consists of many mobile nodes with limited computing capability and a powerful node with less restriction. In 2007, Tseng showed that Nam et al.'s protocol is not a contributory GKA, while he also proposed a new GKA protocol. However, neither GKA protocol is concerned with dynamic member joining/leaving. This is an important functionality of GKA, especially for a wireless network environment. In this paper, we propose a dynamic group key agreement protocol for imbalanced wireless networks, and show that it requires less computation cost for dynamic member joining/leaving as compared to the previously proposed protocols. We also show that the proposed protocol is provably secure against passive attacks under the decision Diffie-Hellman problem and the hash function assumptions. Furthermore, by the pre-shared two-party key between a mobile node and the powerful node in the existing imbalanced wireless networks, we propose a generalized GKA protocol that requires only several hash functions.",
author = "Chuang, {Yun Hsin} and Yuh-Min Tseng",
year = "2010",
month = "7",
day = "1",
doi = "10.1002/nem.739",
language = "English",
volume = "20",
pages = "167--180",
journal = "International Journal of Network Management",
issn = "1055-7148",
publisher = "John Wiley and Sons Ltd",
number = "4",

}

An efficient dynamic group key agreement protocol for imbalanced wireless networks. / Chuang, Yun Hsin; Tseng, Yuh-Min.

In: International Journal of Network Management, Vol. 20, No. 4, 01.07.2010, p. 167-180.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient dynamic group key agreement protocol for imbalanced wireless networks

AU - Chuang, Yun Hsin

AU - Tseng, Yuh-Min

PY - 2010/7/1

Y1 - 2010/7/1

N2 - Owing to the popularity of wireless networks, the group key agreement (GKA) design is critical for providing secure group communications over an insecure wireless channel. In 2005, Nam et al. proposed a GKA protocol for imbalanced wireless networks in which an imbalanced wireless network consists of many mobile nodes with limited computing capability and a powerful node with less restriction. In 2007, Tseng showed that Nam et al.'s protocol is not a contributory GKA, while he also proposed a new GKA protocol. However, neither GKA protocol is concerned with dynamic member joining/leaving. This is an important functionality of GKA, especially for a wireless network environment. In this paper, we propose a dynamic group key agreement protocol for imbalanced wireless networks, and show that it requires less computation cost for dynamic member joining/leaving as compared to the previously proposed protocols. We also show that the proposed protocol is provably secure against passive attacks under the decision Diffie-Hellman problem and the hash function assumptions. Furthermore, by the pre-shared two-party key between a mobile node and the powerful node in the existing imbalanced wireless networks, we propose a generalized GKA protocol that requires only several hash functions.

AB - Owing to the popularity of wireless networks, the group key agreement (GKA) design is critical for providing secure group communications over an insecure wireless channel. In 2005, Nam et al. proposed a GKA protocol for imbalanced wireless networks in which an imbalanced wireless network consists of many mobile nodes with limited computing capability and a powerful node with less restriction. In 2007, Tseng showed that Nam et al.'s protocol is not a contributory GKA, while he also proposed a new GKA protocol. However, neither GKA protocol is concerned with dynamic member joining/leaving. This is an important functionality of GKA, especially for a wireless network environment. In this paper, we propose a dynamic group key agreement protocol for imbalanced wireless networks, and show that it requires less computation cost for dynamic member joining/leaving as compared to the previously proposed protocols. We also show that the proposed protocol is provably secure against passive attacks under the decision Diffie-Hellman problem and the hash function assumptions. Furthermore, by the pre-shared two-party key between a mobile node and the powerful node in the existing imbalanced wireless networks, we propose a generalized GKA protocol that requires only several hash functions.

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

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

U2 - 10.1002/nem.739

DO - 10.1002/nem.739

M3 - Article

VL - 20

SP - 167

EP - 180

JO - International Journal of Network Management

JF - International Journal of Network Management

SN - 1055-7148

IS - 4

ER -