摘要
提出把B-树引入到管理机制中,并给出了加入协议和离开协议的形式化描述。B-树方案在通信开销和计算开销方面优于二叉树方案,并且二者的差距随着B-树阶数的增大和群组成员数目的增加而明显加大。在安全性方面,B-树方案能够抵抗联合攻击。
After a distributed binary tree-based group key management scheme is studied, a B-tree-based scheme is proposed in this paper. At the aspects of communication cost and computation cost, the B-tree-based scheme is better than the binary tree-based scheme and the difference becomes larger obviously as the order of B-tree and the number of group members grow. The join protocol and leave protocol are described formally. In addition, the B-tree-based scheme is secure against collusive attacks.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第20期3-4,88,共3页
Computer Engineering
基金
国家自然科学基金资助项目(6023012)
