安全组播中密钥分配问题的研究
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant No.60272043 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2002AA121067 (国家高技术研究发展计划(863))


A Study of the Key Distribution in Secure Multicast
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    组播是面向组接收者的首选网络通信技术,其重要性随着Internet的发展日益突出.组管理协议IGMP不提供成员接入控制.为了保护通信机密性,安全组播使用仅为认证组成员所知的会话加密密钥(SEK)来加密业务数据.每当组成员关系发生变化时,都应动态更新SEK,密钥分配也就成为安全组播研究的关键问题.在设计密钥分配算法时,通信开销、存储开销、抗冲击性和计算开销被认为是4个重要因素.提出了一种利用多项式展开的组密钥分配方案,其特点是不使用传统加密和解密.分析表明,其在小型组播中可获得较好的性能.将基于多项式展开的该算法与逻辑密钥层次结合,又提出了一种PE-LKH方案,在保留通信开销随组规模呈对数增长的同时,其计算复杂度有效降低,可适用于大规模动态群组.

    Abstract:

    Multicast is a preferred network communication technique in the case of multiple recipients, whose importance has been increasingly highlighted with the development of the Internet. IGMP, the multicastmanagement protocol, does not provide access control of the users. In order to protect communicationconfidentiality, traffic in secure multicast is encrypted with a Session Encryption Key (SEK) which is known only to the certificated group members. Whenever there is a change in the group membership, the SEK has to bedynamically updated, thus the key distribution becomes a key problem in the research of secure multicast. In designing key distribution algorithms, communication costs, key storage, protection against attacks and computation complexity are considered as the four important factors. A group key distribution scheme utilizing a polynomial expansion is proposed, which features in no traditional encryption and decryption. Analyses show that it performs well in small scale multicast. This polynomial expansion based algorithm is then integrated with the Logical Key Hierarchy; while preserving the logarithmic communication cost with the group size, the presented PE-LKH scheme lowers the computation complexity observably, thus is scalable to large dynamic groups.

    参考文献
    相似文献
    引证文献
引用本文

朱文涛,熊继平,李津生,洪佩琳.安全组播中密钥分配问题的研究.软件学报,2003,14(12):2052-2059

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2003-02-27
  • 最后修改日期:2003-09-15
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号