高效的分布式组密钥协商机制  

Efficient distributed group key agreement scheme

作　　者：张江[1] 张萌[1] 陈春晓[1] 杨士强[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《清华大学学报（自然科学版）》2008年第1期101-105,共5页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金资助项目(60432030);国家"九七三"基础研究基金项目(2006CB303103)

摘　　要：为了解决现有的组密钥协商机制需要各组用户在本地维护完整的密钥树信息,从而严重制约安全组播系统可扩展性的问题,提出一种高效的分布式组密钥协商机制(EDKAS)。在该机制中,每个组用户仅需维护一个五元组结构的密钥树分支,降低了用户的存储开销和通信开销。同时,该机制采用分布式树平衡算法,使得尽管每个组用户仅维护部分密钥树信息,仍可以很好地保持密钥树的平衡。实验结果表明:EDKAS可以有效地降低维护密钥树的存储开销和通信开销,可适用于较大规模的分布式安全组播系统。An efficient distributed group key agreement scheme was developed to improve the poor scalability of most existing distributed group key agreement schemes which require each member to maintain the whole key tree structure. In this scheme, each group member maintains only a key tree branch including five element sets, which reduces the storage and communication costs of each member. A distributed tree balancing algorithm is used to keep the whole key tree as balanced as possible for rekeying efficiency, even though each member has only partial information for the whole key tree. Test results demonstrate that the scheme significantly reduces the storage and communication costs for each member for maintaining the key tree, thus, the scheme can be scaled to large groups.

关 键 词：数据安全 组密钥协商 密钥树分支 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]