Two-round contributory group key exchange protocol for wireless network environments

Tsu Yang Wu, Yuh-Min Tseng, Ching Wen Yu

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

With the popularity of group-oriented applications, secure group communication has recently received much attention from cryptographic researchers. A group key exchange (GKE) protocol allows that participants cooperatively establish a group key that is used to encrypt and decrypt transmitted messages. Hence, GKE protocols can be used to provide secure group communication over a public network channel. However, most of the previously proposed GKE protocols deployed in wired networks are not fully suitable for wireless network environments with low-power computing devices. Subsequently, several GKE protocols suitable for mobile or wireless networks have been proposed. In this article, we will propose a more efficient group key exchange protocol with dynamic joining and leaving. Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides forward/backward secrecy for dynamic member joining/leaving. As compared with the recently proposed GKE protocols, our protocol provides better performance in terms of computational cost, round number, and communication cost.

Original languageEnglish
Article number12
JournalEurasip Journal on Wireless Communications and Networking
Volume2011
Issue number1
DOIs
Publication statusPublished - 2011 Dec 1

Fingerprint

Wireless networks
Network protocols
Joining
Communication
Hash functions
Costs

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

@article{1db4a3c1819b4d508b49b310742b774e,
title = "Two-round contributory group key exchange protocol for wireless network environments",
abstract = "With the popularity of group-oriented applications, secure group communication has recently received much attention from cryptographic researchers. A group key exchange (GKE) protocol allows that participants cooperatively establish a group key that is used to encrypt and decrypt transmitted messages. Hence, GKE protocols can be used to provide secure group communication over a public network channel. However, most of the previously proposed GKE protocols deployed in wired networks are not fully suitable for wireless network environments with low-power computing devices. Subsequently, several GKE protocols suitable for mobile or wireless networks have been proposed. In this article, we will propose a more efficient group key exchange protocol with dynamic joining and leaving. Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides forward/backward secrecy for dynamic member joining/leaving. As compared with the recently proposed GKE protocols, our protocol provides better performance in terms of computational cost, round number, and communication cost.",
author = "Wu, {Tsu Yang} and Yuh-Min Tseng and Yu, {Ching Wen}",
year = "2011",
month = "12",
day = "1",
doi = "10.1186/1687-1499-2011-12",
language = "English",
volume = "2011",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",
number = "1",

}

Two-round contributory group key exchange protocol for wireless network environments. / Wu, Tsu Yang; Tseng, Yuh-Min; Yu, Ching Wen.

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2011, No. 1, 12, 01.12.2011.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Two-round contributory group key exchange protocol for wireless network environments

AU - Wu, Tsu Yang

AU - Tseng, Yuh-Min

AU - Yu, Ching Wen

PY - 2011/12/1

Y1 - 2011/12/1

N2 - With the popularity of group-oriented applications, secure group communication has recently received much attention from cryptographic researchers. A group key exchange (GKE) protocol allows that participants cooperatively establish a group key that is used to encrypt and decrypt transmitted messages. Hence, GKE protocols can be used to provide secure group communication over a public network channel. However, most of the previously proposed GKE protocols deployed in wired networks are not fully suitable for wireless network environments with low-power computing devices. Subsequently, several GKE protocols suitable for mobile or wireless networks have been proposed. In this article, we will propose a more efficient group key exchange protocol with dynamic joining and leaving. Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides forward/backward secrecy for dynamic member joining/leaving. As compared with the recently proposed GKE protocols, our protocol provides better performance in terms of computational cost, round number, and communication cost.

AB - With the popularity of group-oriented applications, secure group communication has recently received much attention from cryptographic researchers. A group key exchange (GKE) protocol allows that participants cooperatively establish a group key that is used to encrypt and decrypt transmitted messages. Hence, GKE protocols can be used to provide secure group communication over a public network channel. However, most of the previously proposed GKE protocols deployed in wired networks are not fully suitable for wireless network environments with low-power computing devices. Subsequently, several GKE protocols suitable for mobile or wireless networks have been proposed. In this article, we will propose a more efficient group key exchange protocol with dynamic joining and leaving. Under the decision Diffie-Hellman (DDH), the computation Diffie-Hellman (CDH), and the hash function assumptions, we demonstrate that the proposed protocol is secure against passive attack and provides forward/backward secrecy for dynamic member joining/leaving. As compared with the recently proposed GKE protocols, our protocol provides better performance in terms of computational cost, round number, and communication cost.

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

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

U2 - 10.1186/1687-1499-2011-12

DO - 10.1186/1687-1499-2011-12

M3 - Article

VL - 2011

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

IS - 1

M1 - 12

ER -