Title: Secure group key management scheme for simultaneous multiple groups with overlapped memberships using binomial key tree with new approach to key distribution and key computation

Authors: B.R. Purushothama; B.B. Amberker

Addresses: Department of Computer Science and Engineering, National Institute of Technology Warangal, Warangal, Andhra Pradesh-506004, India ' Department of Computer Science and Engineering, National Institute of Technology Warangal, Warangal, Andhra Pradesh-506004, India

Abstract: In secure group communication model, key management is a challenging task. We propose a new approach for key distribution and key computation for the secure group key management based on polynomial interpolation method using binomial tree structure. The rich literature available for key management schemes for secure group communication focuses on operating only a single group. We focus on operation of simultaneous multiple groups with overlapping memberships. We design an efficient secure group key management scheme for simultaneous multiple groups with overlapping memberships. A new key structure called binomial key tree queue is proposed and new approach is used for key distribution and computation. The scheme scales well as the overlapping memberships across the multiple groups increases. The proposed scheme achieves significant reduction in rekeying and storage cost compared to two existing schemes in literature. Interestingly, efficiency in rekeying cost is achieved without much increase in storage at users.

Keywords: simultaneous multiple groups; binomial key tree queues; BKTQ; overlapping memberships; rekeying; group key management; polynomial interpolation; security; key distribution; key computation; storage cost.

DOI: 10.1504/IJTMCC.2013.053279

International Journal of Trust Management in Computing and Communications, 2013 Vol.1 No.2, pp.175 - 198

Received: 02 Oct 2012
Accepted: 21 Dec 2012

Published online: 12 Apr 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article