AnEfficient BatchRekeyingScheme Basedon One-Way Function Tree

Existing methods forhandling groupkeyupdating in amulticast environment aremainly based oncentralized hierarchical keytree, buttheycan't meetthedemandsforhighly dynamic applications withlarge groupsize ofupto218 ormore,astheir scalabilities arelimited by timecostandavailable multicast bandwidth. An efficient batchrekeying scheme basedonone-way function tree(OFT) andminimumexactcovering ispresented inthis paper.Result showsthatouralgorithm ismoreefficient than previous schemes andcanachieve desired scalability intermsof computational andcommunication overhead. Keywords-secure multicast, batch rekeying, one-way fiuction I. Introduction Multicast isanefficient method formanyemerging network applications, liketeleconferencing, PayTV,

[1]  Dilip D. Kandlur,et al.  Key management for secure lnternet multicast using Boolean function minimization techniques , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).