An efficient dynamic group key agreement for low-power mobile devices

Seokhyang Cho, Junghyun Nam, Seung-Joo Kim, Dongho Won

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server (application servers) with sufficient computational power and a cluster of mobile devices (clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants (PDAs). Furthermore, we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol that offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its security against a passive adversary in the random oracle model.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsO. Gervasi, M.L. Gavrilova, V. Kumar, A. Lagana, H.P. Lee, Y. Mun, D. Taniar, C.J.K. Tan
Pages498-507
Number of pages10
Volume3480
EditionI
Publication statusPublished - 2005
Externally publishedYes
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Other

OtherInternational Conference on Computational Science and Its Applications - ICCSA 2005
CountrySingapore
Period05/5/905/5/12

Fingerprint

Mobile devices
Network protocols
Servers
Smart cards
Mobile computing
Personal digital assistants
Computational efficiency
Costs

Keywords

  • CDH assumption
  • Group key agreement
  • Mobile devices
  • Multicast

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Cho, S., Nam, J., Kim, S-J., & Won, D. (2005). An efficient dynamic group key agreement for low-power mobile devices. In O. Gervasi, M. L. Gavrilova, V. Kumar, A. Lagana, H. P. Lee, Y. Mun, D. Taniar, ... C. J. K. Tan (Eds.), Lecture Notes in Computer Science (I ed., Vol. 3480, pp. 498-507)

An efficient dynamic group key agreement for low-power mobile devices. / Cho, Seokhyang; Nam, Junghyun; Kim, Seung-Joo; Won, Dongho.

Lecture Notes in Computer Science. ed. / O. Gervasi; M.L. Gavrilova; V. Kumar; A. Lagana; H.P. Lee; Y. Mun; D. Taniar; C.J.K. Tan. Vol. 3480 I. ed. 2005. p. 498-507.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cho, S, Nam, J, Kim, S-J & Won, D 2005, An efficient dynamic group key agreement for low-power mobile devices. in O Gervasi, ML Gavrilova, V Kumar, A Lagana, HP Lee, Y Mun, D Taniar & CJK Tan (eds), Lecture Notes in Computer Science. I edn, vol. 3480, pp. 498-507, International Conference on Computational Science and Its Applications - ICCSA 2005, Singapore, 05/5/9.
Cho S, Nam J, Kim S-J, Won D. An efficient dynamic group key agreement for low-power mobile devices. In Gervasi O, Gavrilova ML, Kumar V, Lagana A, Lee HP, Mun Y, Taniar D, Tan CJK, editors, Lecture Notes in Computer Science. I ed. Vol. 3480. 2005. p. 498-507
Cho, Seokhyang ; Nam, Junghyun ; Kim, Seung-Joo ; Won, Dongho. / An efficient dynamic group key agreement for low-power mobile devices. Lecture Notes in Computer Science. editor / O. Gervasi ; M.L. Gavrilova ; V. Kumar ; A. Lagana ; H.P. Lee ; Y. Mun ; D. Taniar ; C.J.K. Tan. Vol. 3480 I. ed. 2005. pp. 498-507
@inproceedings{fbccedc87dc94dafa12f05ad2018c8b8,
title = "An efficient dynamic group key agreement for low-power mobile devices",
abstract = "Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server (application servers) with sufficient computational power and a cluster of mobile devices (clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants (PDAs). Furthermore, we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol that offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its security against a passive adversary in the random oracle model.",
keywords = "CDH assumption, Group key agreement, Mobile devices, Multicast",
author = "Seokhyang Cho and Junghyun Nam and Seung-Joo Kim and Dongho Won",
year = "2005",
language = "English",
volume = "3480",
pages = "498--507",
editor = "O. Gervasi and M.L. Gavrilova and V. Kumar and A. Lagana and H.P. Lee and Y. Mun and D. Taniar and C.J.K. Tan",
booktitle = "Lecture Notes in Computer Science",
edition = "I",

}

TY - GEN

T1 - An efficient dynamic group key agreement for low-power mobile devices

AU - Cho, Seokhyang

AU - Nam, Junghyun

AU - Kim, Seung-Joo

AU - Won, Dongho

PY - 2005

Y1 - 2005

N2 - Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server (application servers) with sufficient computational power and a cluster of mobile devices (clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants (PDAs). Furthermore, we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol that offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its security against a passive adversary in the random oracle model.

AB - Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server (application servers) with sufficient computational power and a cluster of mobile devices (clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants (PDAs). Furthermore, we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol that offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its security against a passive adversary in the random oracle model.

KW - CDH assumption

KW - Group key agreement

KW - Mobile devices

KW - Multicast

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

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

M3 - Conference contribution

AN - SCOPUS:24944459002

VL - 3480

SP - 498

EP - 507

BT - Lecture Notes in Computer Science

A2 - Gervasi, O.

A2 - Gavrilova, M.L.

A2 - Kumar, V.

A2 - Lagana, A.

A2 - Lee, H.P.

A2 - Mun, Y.

A2 - Taniar, D.

A2 - Tan, C.J.K.

ER -