一种动态组播的密钥更新算法  

A Rekeying Algorithms for Dynamics Multicast

作　　者：高俊伟[1] 杨宗凯[1] 

机构地区：[1]华中科技大学电子与信息工程系,武汉430074

出　　处：《计算机科学》2007年第3期54-55,86,共3页Computer Science

摘　　要：为了保证组播通信的机密性,安全组播使用不为组外成员所知的密钥来加密数据,并随组成员关系的变化而动态更新。基于树型分层式密钥管理方式使用户变更时的密钥更新代价减小,但前提是密钥树必须保持平衡。本文提出了一种应用m序B树作为组密钥树的密钥管理方法,在组播组中加入一个新成员,本方案比传统方案减少了密钥更新开销量,提高密钥更新效率。To provide communication confidentiality in multicasting applications , traffic data in secure multicast is encrypted with a session key known only by certificated group members. Whenever there is a change in the group membership, the session key must be updated dynamically. The hierarchical key-tree approach can achieve logarithmic rekeying costs. However , the efficient of hierarchical key-tree depends on whether the key tree remains balanced. In this paper, we propose to use an order-m B-tree as multicasting key management trees, the rekeying cost of inserting a new member is reduced compared to using the traditional hierarchical key-tree.

关 键 词：密钥管理 安全组播 密钥更新 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]