University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Scalable balanced batch rekeying for secure group communication

Ng, WHD, Cruickshank, Haitham and Sun, Zhili (2006) Scalable balanced batch rekeying for secure group communication COMPUTERS & SECURITY, 25 (4). pp. 265-273.

[img] Text
Computers-and-Security - 20006.pdf
Restricted to Repository staff only
Available under License : See the attached licence file.

Download (655kB)
[img] Text (licence)
Restricted to Repository staff only

Download (33kB)


Secure group communication is important for applications such as pay-per-view. Other authors have proposed the key tree approach to distribute a shared group key in a way such that the rekeying cost scales linearly with the logarithm of the group size for a join or depart request. The efficiency of the key tree approach depends critically on whether the key tree remains balanced. Periodic rebalancing can be used to balance the key tree whenever it becomes unbalanced but this adds extra costs to the network. In this paper, we present two Merging Algorithms suitable for batch join events. As the multicast session consists of other events as well, we then show how we can extend our algorithms into existing work to minimise the maximum difference in height without adding extra network costs. Simulation results show our Merging Algorithms not only balance the key tree but their rekeying costs are lower compared to existing algorithms. (C) 2006 Elsevier Ltd. All rights reserved.

Item Type: Article
Divisions : Surrey research (other units)
Authors :
Date : June 2006
DOI : 10.1016/j.cose.2006.02.006
Depositing User : Symplectic Elements
Date Deposited : 28 Mar 2017 14:44
Last Modified : 24 Jan 2020 11:45

Actions (login required)

View Item View Item


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