首页 | 本学科首页   官方微博 | 高级检索  
     

适于移动Ad hoc网络通信的多域签密算法
引用本文:李志敏,徐馨,李存华.适于移动Ad hoc网络通信的多域签密算法[J].吉林大学学报(工学版),2012(Z1):322-326.
作者姓名:李志敏  徐馨  李存华
作者单位:淮海工学院计算机工程学院
基金项目:江苏省自然科学基金项目(BK20082140);淮海工学院引进人才科研启动基金项目(KQ10121);淮海工学院校内课题项目(KX10530)
摘    要:针对移动Ad hoc通信中的安全问题,利用双线性对的优点,结合基于身份加密体制,设计了一个存在多个私钥生成中心的签密算法,适合多域Ad hoc网络使用。基于计算Diffie-Hellman问题困难的假设下,在随机预言模型中证明了算法的安全性。方案设计简单,效率高,能够满足Ad hoc网络安全需求。

关 键 词:计算机应用  Ad  hoc网络  签密  可证明安全  双线性对  随机预言模型

Multi-domain signcryption algorithm for communication of mobile Ad hoc networks
LI Zhi-min,XU Xin,LI Cun-hua.Multi-domain signcryption algorithm for communication of mobile Ad hoc networks[J].Journal of Jilin University:Eng and Technol Ed,2012(Z1):322-326.
Authors:LI Zhi-min  XU Xin  LI Cun-hua
Affiliation:(School of Computer Engineering,Huaihai Institute of Technology,Lianyungang 222005,China)
Abstract:In order to insure the security of communication in mobile Ad hoc networks,a new signcryption scheme with multiple private key generators was proposed.The proposed scheme was based on bilinear pairing and identity cryptography,it is suitable for multi-domain Ad hoc networks.Under the assumption that the computational Diffie-Hellman is difficult,the security of the scheme has been proved under the random oracle model.It is concluded that the proposed scheme satisfies the security requirements of Ad hoc networks and has less computation and storage requirements.
Keywords:computer application  Ad hoc networks  signcryption  provably secure  bilinear pairings  random oracle model
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号