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

Effective and secure identity-based hybrid signcryption scheme

作　　者：仝瑞阳[1] 孟庆见[1] 陈明[2] 

机构地区：[1]河南城建学院计算机科学与工程系,河南平顶山467036 [2]重庆大学计算机学院,重庆400044

出　　处：《计算机应用》2013年第5期1382-1385,1393,共5页journal of Computer Applications

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

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

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

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]