Secured Rekeying in B-Tree and NSBHO Tree

Many emerging Web and Internet applications are based on a group communication model. Securing group communication is an important Internet design issue. A Key Graph approach has been used to implement the group key management and it is used to provide secure group communication. The group key management can be done in two ways: 1. Individual rekeying 2. Batch rekeying. Individual Rekeying is the process of rekeying after each join or leave request. The problem with individual rekeying is inefficiency and out-of-sync problem between keys and data. A batch rekeying using MARKING ALGORITHM can overcome the problems faced in the individual rekeying. The paper applies Batch rekeying by Marking Algorithm on the B-Tree (2-3 trees) and NSBHO (Non Splitting Balancing Higher Order) tree. The Analyzing done on the key server’s processing cost for batch rekeying in B-Tree and NSBHO tree. The proposed NSBHO (Non-Split Balancing High-Order) tree in which balancing tree after member joining does not involve node splitting. The implementation shows that the NSBHO tree has better average-case rekeying performance and far superior worst-case rekeying performance than a B-tree.