Efficient Multicast Key Management for Stateless Receivers
Efficient Multicast Key Management for Stateless Receivers
复制标题
无状态接收器的高效组播密钥管理
DOI：
10.1007/3-540-36552-4_34
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Chang
中科院分区：
文献类型：
--
作者：
JuHee Ki;Hyun;Dong Hoon Lee;Chang
在多播通信系统中，组成员拥有公共组密钥并且使用该密钥进行通信。为了保证组成员之间的通信，必须对组密钥进行安全有效的管理。特别是在一个动态的大型组中，组密钥管理的效率是至关重要的，因为删除或添加的成员的大小可能相当大。文献中提出的大多数方案都隐含地假设成员是不断在线的，这在许多接收设备中是无法实现的。在本文中，我们提出了一个层次化的二叉树为基础的密钥管理方案的动态大组与一个组控制器（GC），特别适合于无状态的接收者，谁不更新他们的状态从会话到会话。在我们的方案中，除了未投出的一个密钥外，所有的密钥更新消息都是不加任何加密的，密钥更新所需的所有计算都是O（log2n）的单向散列函数和XOR运算的应用，密钥更新所需的所有信息都在当前盲因子和初始信息中。所提出的方案提供了向后和向前保密。如果使用子弹头板，每个成员可以计算所有需要的密钥，而无需任何密钥更新消息。
In a multicast communication system, group members possess a common group key and communicate us ng the key. For the commun cat on between group members the group key must be managed securely and efficiently. Especially in a dynamic and large group the efficiency of the group key management is critical is since the size of deleted or added members may be quite large. Most schemes proposed in the literature implicitly assume that members is constantly on-line, which is not realizable in many receiving devices. In the paper, we propose a hierarchical binary tree-based key management scheme for a dynamic large group with one group controller(GC), especially well suitable to stateless receivers , who do not update their state from session to session. In our scheme, all re-keying messages except for un cast of a nd vidual key are transm tted without any encryption, all computat on needed for re-keying isO( log2n) applications of one-way hash funct on and XOR operation, and all information needed for re-keying is in the current blinded factors and the initial informaton. The proposed scheme provides both backward and forward secrecy. If a bullet n board is used, each member can compute all needed keys without any re-keying messages.