Non-split balancing higher order tree for multi-privileged groups

Authors:
A. Muthulakshmi;R. Anitha;M. Sumathi
Affiliations:
Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore, India;Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore, India;Department of Mathematics and Computer Applications, PSG College of Technology, Coimbatore, India
Venue:
WSEAS TRANSACTIONS on COMMUNICATIONS
Year:
2011

Citing 13
Cited 0

Secure group communications using key graphs

IEEE/ACM Transactions on Networking (TON)
Batch rekeying for secure group communications

Proceedings of the 10th international conference on World Wide Web
Key Establishment in Large Dynamic Groups Using One-Way Function Trees

IEEE Transactions on Software Engineering
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation.

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Algorithms for dynamic multicast key distribution trees

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication

ACM Computing Surveys (CSUR)
Protocol design for scalable and reliable group rekeying

IEEE/ACM Transactions on Networking (TON)
A Novel High-Order Tree for Secure Multicast Key Management

IEEE Transactions on Computers
Dynamic Balanced Key Tree Management for Secure Multicast Communications

IEEE Transactions on Computers
Efficient group key management for multi-privileged groups

Computer Communications
Hierarchical group access control for secure multicast communications

IEEE/ACM Transactions on Networking (TON)
Scalable secure group communication over IP multicast

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In group communication scenario, key management is important to preserve forward and backward secrecy. In order to achieve it keys need to be changed during user join/leave which is done by an operation called rekeying. In a centralized key management scheme, the server thereafter passes the new keys to the existing users who are affected via unicasts and multicasts. The number of unicasts and multicasts decide the rekeying cost. B-trees and NSBHO trees help to reduce the rekeying cost as compared to the binary trees. This paper discusses the use of these trees in Multiprivileged environment providing the algorithms for user join/leave as well as rekeying algorithms in both the cases. The bounds for the heights of the trees have been given and also the rekeying costs in the three cases have been addressed.