【作者】 董永先；

【导师】 许建真；

【作者基本信息】 南京邮电大学 ， 计算机应用技术， 2011， 硕士

【摘要】 组播是下一代Internet应用的重要支撑技术,而组播的安全性是成功进行组通信所必需解决的重要课题之一。目前,人们已提出多种密钥管理方案,并采用不同的组密钥更新方案来处理组成员的动态变化。组密钥管理的基本结构主要有基于两层结构和多层结构。由于多层结构资源开销较大且系统时延较长,其不适合成员关系频繁变化的大型动态群组。因此,目前适合成员关系频繁变化的大型动态群组的组播密钥管理方案十分有限。本文在分析基于两层结构的密钥管理以及安全哈希函数理论的基础上,提出了一种新的密钥管理方案GC-RH (Group Center-Random and Hash)。文章通过对组播密钥管理及相关密钥算法技术研究,取得以下成果:1.设计了一个组播密钥管理方案。该方案在IKAM结构的基本模型基础上加以改进。对IKAM结构中的子组进行改进,将原有的子组结构改成二叉平衡树结构。由于本文提出的RH密钥更新算法具有较高的密钥分配效率,因此在子组内采用该算法作为密钥更新算法。从而进一步提高了密钥更新的效率,减小了通信消息和计算开销及网络宽带的利用率。2.引入一种新的密钥分配方案,RH (Random and Hash)密钥分配方案,并将此方案应用到Area[1]中作为密钥分配算法,其能够抵抗任意数目用户的共同攻击,其进行组密钥更新需要更少的通信消息和计算开销,可以减少对网络带宽资源的占用以及降低组控制中心GC和用户的计算开销。最后,仿真结果表明RH密钥更新算法及密钥管理方案在密钥存储量、加密计算量、网络通信量等性能方面都优于其它同类方案,比较适用于大型动态组播环境,具备较好的理论研究与实际应用价值。更多还原

【Abstract】 Multicast is an important support for next-generation Internet application technology, and security of the multicast is one of the most important subjects for group communication to resolve.At present, people have proposed a variety of key management program, and use different group key update scheme to deal with the dynamics group. The basic structure of group key management includes two layers and multilayer structures. For the larger system resource overhead and longer system delay of multi-layer structure, it is not suitable for large dynamic group whose membership changes frequently. Therefore, now multicast key management scheme which is suitable for the membership changes frequently in a large dynamic multicast is limited.This paper presents a new key management scheme which based on a two-tier structure key management, and the security hash function theory.The article related to multicast key management and key algorithm technology, achieved the following results:1. I design a Multicast Key Management Scheme. This scheme based on the structure of IKAM and improved it. Structure of the sub-group in IKAM will be improved, the original sub-group structure will be replaced by a binary balanced tree. Since the proposed key renew algorithm RH has higher efficiency of key distribution, i use RH algorithm as the key update algorithm in sub-group. And it will further improve the efficiency of key update, reduce the computational overhead of communication and the utilization of network bandwidth.2. Introduce a new key distribution scheme, RH (Random and Hash) key distribution scheme, and applied as a key distribution algorithm in Area, it can resist any number of user attacks together. When the group key is updating, it requires less communication messages and computational overhead. It also can reduce the occupation of network bandwidth and reduce computing costs of the group control center GC and the users.Finally, the simulation results show that the RH key update algorithm and key management solutions in the key storage, encryption computation, network traffic and other properties are better than other similar programs, then it is suitable comparatively to large dynamic multicast environment, with better theoretical research and practical application.更多还原