Group Key Agreement for Ad Hoc Networks

Lijun Liao

Paper 2006/006

Group Key Agreement for Ad Hoc Networks

Lijun Liao

Abstract

Over the last 30 years the study of group key agreement has stimulated much work. And as a result of the increased popularity of ad hoc networks, some approaches for the group key establishment in such networks are proposed. However, they are either only for static group or the memory, computation and communication costs are unacceptable for ad-hoc networks. In this thesis some protocol suites from the literature (2^d-cube, 2^d-octopus, Asokan-Ginzboorg, CLIQUES, STR and TGDH) shall be discussed. We have optimized STR and TGDH by reducing the memory, communication and computation costs. The optimized version are denoted by µSTR and µTGDH respectively. Based on the protocol suites µSTR and µTGDH we present a Tree-based group key agreement Framework for Ad-hoc Networks (TFAN). TFAN is especially suitable for ad-hoc networks with limited bandwidth and devices with limited memory and computation capability. To simulate the protocols, we have implemented TFAN, µSTR and µTGDH with J2ME CDC. The TFAN API will be described in this thesis.

Note: Master Thesis

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. www.nds.rub.de/liao
Keywords: µSTR µTGDH TFAN ad-hoc networks group key agreement
Contact author(s): lijun liao @ rub de
History: 2006-01-10: received
Short URL: https://ia.cr/2006/006
License: CC BY

BibTeX

@misc{cryptoeprint:2006/006,
      author = {Lijun Liao},
      title = {Group Key Agreement for Ad Hoc Networks},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/006},
      year = {2006},
      url = {https://eprint.iacr.org/2006/006}
}