论文部分内容阅读
为了解决现有的组密钥协商机制需要各组用户在本地维护完整的密钥树信息,从而严重制约安全组播系统可扩展性的问题,提出一种高效的分布式组密钥协商机制(EDKAS)。在该机制中,每个组用户仅需维护一个五元组结构的密钥树分支,降低了用户的存储开销和通信开销。同时,该机制采用分布式树平衡算法,使得尽管每个组用户仅维护部分密钥树信息,仍可以很好地保持密钥树的平衡。实验结果表明:EDKAS可以有效地降低维护密钥树的存储开销和通信开销,可适用于较大规模的分布式安全组播系统。
In order to solve the problem that the existing group key agreement mechanism needs each group of users to maintain the complete key tree information locally and seriously restrict the scalability of the security multicast system, an efficient distributed group key agreement mechanism is proposed EDKAS). In this mechanism, each group of users only needs to maintain a key tree branch of a five-tuple structure, reducing the storage overhead and communication overhead of users. At the same time, this mechanism adopts the distributed tree balance algorithm, so that although each group of users maintains only a part of the key tree information, the key tree balance can still be well maintained. The experimental results show that EDKAS can effectively reduce the memory overhead and communication overhead of the maintenance key tree and can be applied to a large-scale distributed secure multicast system.