计算机应用 ›› 2013, Vol. 33 ›› Issue (05): 1382-1393.DOI: 10.3724/SP.J.1087.2013.01382

• 信息安全 • 上一篇    下一篇

高效安全的身份混合签密方案

仝瑞阳1,孟庆见1,陈明2   

  1. 1. 河南城建学院 计算机科学与工程系,河南 平顶山 467036
    2. 重庆大学 计算机学院,重庆 400044
  • 收稿日期:2012-11-06 修回日期:2012-12-31 出版日期:2013-05-01 发布日期:2013-05-08
  • 通讯作者: 仝瑞阳
  • 作者简介:仝瑞阳(1965-),男,河南郏县人,副教授,硕士,主要研究方向:信息安全;孟庆见(1976-),男,河南开封人,助教,硕士,主要研究方向:软件工程;陈明(1978-),男,重庆人,讲师,博士,主要研究方向:信息安全。
  • 基金资助:

    国家自然科学基金资助项目(90818028)

Effective and secure identity-based hybrid signcryption scheme

TONG Ruiyang1,MENG Qingxian1,CHEN Ming2   

  1. 1. Departmen of Computer Science and Engineering, Henan University of Urban Construction, Pingdingshan Henan 467036, China
    2. College of Computer, Chongqing University, Chongqing 400044,China
  • Received:2012-11-06 Revised:2012-12-31 Online:2013-05-08 Published:2013-05-01
  • Contact: TONG Ruiyang

摘要: 现有的基于身份混合签密方案要么存在已知安全缺陷,要么计算开销较高。通过引入vBNN-IBS签名算法,提出一种新的基于身份的混合签密方案。新方案基于椭圆曲线上的离散对数问题和计算Diffie-Hellman问题,不使用双线性对操作,有效地降低了计算开销,总开销降低到只有7次椭圆曲线上的点乘运算,远低于同类型其他方案。在随机预言机模型下,新方案被证明是安全的,满足不可伪造性和机密性。此外,还指出孙银霞等(孙银霞,李晖.高效无证书混合签密.软件学报,2011,22(7): 1690-1698)的方案不满足不可伪造性。

关键词: 基于身份密码学, 混合签密, 离散对数问题, 计算Diffie-Hellman问题, 不可伪造性, 机密性

Abstract: The existing identity-based hybrid signcryption schemes have either known security flaws or higher computational costs. With the vBNN-IBS signature algorithm, a new identity-based hybrid signcryption scheme was proposed. The new scheme, based on the Discrete Logarithm Problem (DLP) and the Computational Diffie-Hellman (CDH) problem on elliptic curve, did not use bilinear operation. So, the total computational costs of the new scheme were effectively reduced, and had only 7 scalar multiplication operations on elliptic curve, which were much lower than the other silimar schemes. In the random oracle model, the new scheme was verified safe enough to achieve the unforgeability and confidentiality. In addition, the paper also pointed out that the Sun et al's scheme (Sun Y X, Li H. Efficient certificateless hybrid signcryption. Journal of Software, 2011,22(7):1690-1698) did not satisfy the unforgeability.

Key words: identity-based cryptography, hybrid signcryption, Discrete Logarithm Problem (DLP), Computational Diffie-Hellman (CDH) problem, unforgeability, confidentiality

中图分类号: