University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Dynamic balanced key tree management for secure multicast communications

Ng, WHD, Howarth, MP, Sun, Z and Cruickshank, H (2007) Dynamic balanced key tree management for secure multicast communications IEEE Transactions on Computers, 56 (5). 590 - 605. ISSN 0018-9340

[img]
Preview
PDF
fulltext.pdf

Download (6Mb)

Abstract

A secure multicast communication is important for applications such as pay-per-view and secure videoconferencing. A key tree approach has been proposed by other authors to distribute the multicast group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or depart request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or depart. In this paper, we present two Merging Algorithms suitable for batch join requests. To additionally handle batch depart requests, we extend these two algorithms to a Batch Balanced Algorithm. Simulation results show that our three algorithms not only maintain a balanced key tree, but their rekeying costs are lower compared with those of existing algorithms.

Item Type: Article
Divisions: Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Communication Systems Research
Depositing User: Mr Adam Field
Date Deposited: 27 May 2010 14:45
Last Modified: 23 Sep 2013 18:35
URI: http://epubs.surrey.ac.uk/id/eprint/1827

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800