Asymptotically Optimal Tree-based Group Key Management Schemes


In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficiently. Selçuk and Sidhu have proposed an efficient scheme which updates dynamically the tree structures based on the withdrawal probabilities of members. In this paper, it is shown… (More)


3 Figures and Tables

Slides referencing similar topics