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

Seokhyang Cho, Junghyun Nam, Seungjoo Kim, Dongho Won

Research output: Contribution to journalConference articlepeer-review

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
Pages (from-to)498-507
Number of pages10
JournalLecture Notes in Computer Science
Volume3480
Issue numberI
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient dynamic group key agreement for low-power mobile devices'. Together they form a unique fingerprint.

Cite this