期刊文献+

基于CDS结构的动态安全组播密钥协商方案

KEY-AGREEMENT SCHEME FOR DYNAMIC SECURE MULTICAST BASED ON CONNECTED DOMINATING SET
在线阅读 下载PDF
导出
摘要 设计高效的密钥协商方案是动态安全组播的难点。提出一个应用椭圆曲线密码体制在基于CDS(Connected Dominating Set)结构的动态安全组播中进行密钥协商的方案,具体地分析了各个子组和整个大的组播组的密钥协商过程,以及组成员动态变化时密钥的更新过程。结果表明,该方案在降低计算和通信代价方面取得了较好的效果,且满足密钥协商的安全要求。 Designing efficient key-agreement scheme is a difficult task in dynamic secure muhicast. In this paper,we propose a novel key agreement scheme which uses Elliptic Curve Cryptosystem in CDS-based dynamic secure muhicast. Then the procedures of key agreement in every subgroup and entire multicast group and the updating process of group keys along with the dynamic change of group members are analyzed in detail. The result shows that our scheme is efficient in cutting down the costs of computation and communication and also satisfies the security requirements of the key agreement.
作者 杨松 陈礼青
出处 《计算机应用与软件》 CSCD 2009年第12期37-39,共3页 Computer Applications and Software
基金 国家自然科学基金项目(60673070) 江苏省自然科学基金项目(BK2006217)
关键词 安全组播 密钥协商 CDS 椭圆曲线密码体制 Secure muhicast Key agreement Connected dominating set(CDS) Elliptic curve cryptosystem
  • 相关文献

参考文献7

  • 1Chunbo Ma,Jun Ao,Jianhua H. A Novel Verifier-Based Authenticated Key Agreement Protocol [ C ]//ICIC 2007, CCIS ,2007,2 : 1044 - 1050.
  • 2EunJun Yoon,KeeYoung Yoo. A New Key Agreement Protocol Based on Chaotic Maps. In : KES-AMSTA 2008, LNAI, 2008,4953:897 - 906.
  • 3Sven Laur, Sylvain Pasini. SAS-Based Group Authentication and Key Agreement Protocols [ C ]//PKC 2008, LNCS ,2008,4939:197 - 213.
  • 4Wan P J, Alzoubi K M,Frieder O. Distributed Construction of Connected Dominating Set in Wireless Ad Hoe Networks[J]. Mobile Networks and Applications ,2004,9 ( 2 ) : 141 - 149.
  • 5Alzoubi K M, Wan P J, Frieder O. Message-optimal Connected-dominating-set Construcion for Routing in Mobile Ad Hoc Networks[ C ]//Proceedings of 3^rd ACM International Symposium Mobile Ad Hoc Networking and Computing,2002.
  • 6张方国,王育民.超椭圆曲线密码体制的研究与进展[J].电子学报,2002,30(1):126-131. 被引量:17
  • 7Oorschot P, Wiener M. Parallel Collision Search with Cryptanalytic Applications [ J ]. Journal of Cryptology, 1999,12 ( 1 ) : 1 - 28.

二级参考文献36

  • 1[1]N Koblitz. Elliptic curve cryptosystems [J]. Math. Comp. 1987, 48(177):203-209.
  • 2[2]V S Miller. Use of elliptic curve in cryptography [ A].In GRYPTO'85( Santa Barbara, Calif., 1985 ), LNCS. 218 [ C ], Spring- Verlag. 1986:417 - 426.
  • 3[3]N Koblitz. Hyperelliptic cryptography [ J ]. J. of Crypto., 1989, 1 (3):139- 150.
  • 4[4]D G Cantor. Computing in the jacobian of a hyperelliptic curve [J].Math. Comp., 1987,48:95 - 101.
  • 5[5]N Koblitz. Algebraic Aspects of Cryptography [ M]. Algorithms and Comutation in Math.3,Springer-Verlag 1998.
  • 6[6]Mumford D. Tata Lectures on Theta Ⅱ [ M ]. Birkhauser-Verlag,Boston. 1984.
  • 7[7]Paulus Ruck, H -G. Real and imaginary quadratic representations of hvperelliptic fmction fields logarithms [ J ]. Math. Comp., 1999, 68:1233 - 1241.
  • 8[8]A Stein. Sharp upper bound for arithmetics in hyperelliptic function rields [ R ]. Techn. Report CORR # 99-23, University of Waterloo (2000) ,68 pages. http://www. cacr. math. uwaterloo. ca.
  • 9[9]Andreas Enge. The extended euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems. http://www. math. umi-augsburg. de/~ enge/Publikationen. html.
  • 10[10]Robin Hartshome. Algebraic Geometry [ M]. GTM 52,Springer-Verlag,New York 1977.

共引文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部