Secure group communication using binomial trees

Authors:
R. Aparna;B. B. Amberker;Divya Pola;Pranjal Bathia
Affiliations:
Dept. of Computer Science and Engg., Siddaganga Institute of Technology, Tumkur, Karnataka, India;Dept. of Computer Science and Engg., National Institute of Technology, WarangaI, Andhra Pradesh, India;Dept. of Computer Science and Engg., National Institute of Technology, WarangaI, Andhra Pradesh, India;Dept. of Computer Science and Engg., National Institute of Technology, WarangaI, Andhra Pradesh, India
Venue:
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Year:
2009

Citing 5
Cited 1

Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
Introduction to algorithms

Introduction to algorithms
Key Establishment in Large Dynamic Groups Using One-Way Function Trees

IEEE Transactions on Software Engineering
A survey of key management for secure group communication

ACM Computing Surveys (CSUR)
Secure Group Communication Using Robust Contributory Key Agreement

IEEE Transactions on Parallel and Distributed Systems

A key management scheme for secure group communication using binomial key trees

International Journal of Network Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Numerous emerging applications like teleconferencing, scientific discussion etc. are relied on secure group communication model. Scalable group rekeying is one of the important issues in secure group communication since the group is dynamic in nature. Updating the group key and delivering it to group members securely must be carried out in an efficient manner, Le., the number of encryptions performed and rekey messages constructed must be less. In this paper we propose a new method to manage secure group using binomial key tree approach. We show that number of encryptions performed and rekey messages constructed during membership change are less compared to the scheme proposed by Wong and others. In our scheme, it is not required to balance the tree after membership change. We compute the average encryption and rekey costs and show that the scheme is scalable.