An efficient scheme to handle bursty behavior in secure group communication using binomial key trees

Authors

  • R. Aparna,

    Corresponding author
    1. Department of Computer Science and Engineering, Siddaganga Institute of Technology, B.H. Road, Tumkur, Karnataka 572103, India
    • Department of Computer Science and Engineering, Siddaganga Institute of Technology, B.H. Road, Tumkur, Karnataka 572103, India.
    Search for more papers by this author
  • B. B. Amberker

    1. Department of Computer Science and Engineering, National Institute of Technology, Warangal, Andhra Pradesh, India
    Search for more papers by this author

Abstract

Secure group communication (SGC) is one of the important research areas and numerous applications are relied upon SGC model. In some applications, such as pay-per-view, periodical electronic information distribution, etc., many users join and leave the group at the same moment known as bursty behavior. In this paper, we propose a scheme for handling bursty behavior. We use binomial key tree (BKT) for managing the secure group, which is quite efficient in handling rekeying strategies. We handle all the possible bursty behavior scenarios and analyze the communication and computation costs for the worst cases. We compare our scheme with the scheme proposed by Wong et al. and show that our scheme is efficient in terms of cost of encryptions and cost of key generation. Copyright © 2010 John Wiley & Sons, Ltd.

Ancillary