Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (18): 93-96.DOI: 10.3778/j.issn.1002-8331.2010.18.030

• 网络、通信、安全 • Previous Articles     Next Articles

Robust signcryption scheme

LI Xiao1,2,HE Ming-xing1,LUO Da-wen1   

  1. 1.School of Mathematics and Computer Engineering,Xihua University,Chengdu 610039,China
    2.Key Laboratory of Information Coding and Transmission,Southwest Jiaotong University,Chendu 610031,China
  • Received:2008-12-09 Revised:2009-02-26 Online:2010-06-21 Published:2010-06-21
  • Contact: LI Xiao


李 虓1,2,何明星1,罗大文1   

  1. 1.西华大学 数学与计算机学院,成都 610039
    2.西南交通大学 信息编码与传输四川省重点实验室,成都 610031
  • 通讯作者: 李 虓

Abstract: The previous ID-based signcryption schemes have some drawbackes,such as the signcryption can be forged;the signcryption can be tampered;the signcryption can’t be public verified,and etc.In this paper,the security of the M-W scheme is analyzed.The bilinear parings are adopted to propose a robust ID-based signcryption scheme.The proposed scheme not only has some characters,such as public verifiability,non-repudiation and forward security,but also has the charaters of unforgeability and robustness.The proposed scheme only needs four bilinear parings,and needn’t the multiplication operation and power operation in G2.It is more efficient than the other ID-based signcryption schemes.

Key words: signcryption, identity based, robustness, bilinear parings

摘要: 已有的基于身份的签密方案存在着签密能被伪造、能被篡改、不能公开验证等缺陷。分析了M-W方案的安全性,并利用双线性对提出了一个健壮的基于身份的签密方案。提出的方案不仅具有公开验证性、不可否认性、前向安全性,而且还具有可伪造性和健壮性。提出的方案只需要4个对运算,没有G2乘法运算和幂运算,比其他基于身份的签密方案效率更高。

关键词: 签密, 基于身份, 健壮性, 双线性对

CLC Number: