2009Unpublished venueRequires access

A M-dimensional Sphere Multicast Rekeying Scheme

Hai-tao Xie, Zongkai Yang, Yuming Wang, Wenqing Cheng

Open publisher page 3 citations

Abstract

Based on analyzing three representative multicast rekeying scheme, such as LKH, OFT and OKD, in this paper, a M-dimensional sphere rekeying scheme for dynamics multicast is put forward. In this new scheme, GC (group key controller) can utilize the cooperation of sibling nodes by one common father as rekeying, when new member joins in or old member leaves, all of sibling nodes will generate a new KEK (key encrypt key) of their father node. By this way, our scheme can improve communication cost special for member leaving, at the same time forward and backward security is ensured. Based on M-dimensional geometry sphere rekeying scheme, we put forward a batch rekeying scheme, by simulation, it is proved that the communication cost of rekeying is reduced, so this scheme can be used in the scene of large-scale dynamics multicast.

About this research paper

What this paper is about

Based on analyzing three representative multicast rekeying scheme, such as LKH, OFT and OKD, in this paper, a M-dimensional sphere rekeying scheme for dynamics multicast is put forward. In this new scheme, GC (group key controller) can utilize the cooperation of sibling nodes by one common father as rekeying, when new member joins in or old member leaves, all of sibling nodes will generate a new KEK (key encrypt key) of their father node. By this way, our scheme can improve communication cost special for member leaving, at the same time forward and backward security is ensured. Based on M-dimensional geometry sphere rekeying scheme, we put forward a batch rekeying scheme, by simulation, it is proved that the communication cost of rekeying is reduced, so this scheme can be used in the scene of large-scale dynamics multicast.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Based on analyzing three representative multicast rekeying scheme, such as LKH, OFT and OKD, in this paper, a M-dimensional sphere rekeying scheme for dynamics multicast is put forward. In this new scheme, GC (group key controller) can utilize the cooperation of sibling nodes by one common father as rekeying, when new member joins in or old member leaves, all of sibling nodes will generate a new KEK (key encrypt key) of their father node. By this way, our scheme can improve communication cost special for member leaving, at the same time forward and backward security is ensured. Based on M-dimensional geometry sphere rekeying scheme, we put forward a batch rekeying scheme, by simulation, it is proved that the communication cost of rekeying is reduced, so this scheme can be used in the scene of large-scale dynamics multicast.

Key concepts: Rekeying, Multicast, Computer science, Secure multicast, Joins, Scheme (mathematics), Computer network, Node (physics)

Related papers

Back to paper searchBrowse research topicsOriginal source
A M-dimensional Sphere Multicast Rekeying Scheme — Research Paper | ScholarLens