新的基于身份的签密方案 |
| |
引用本文: | 姜旗,张应辉,张涛,上官修凤. 新的基于身份的签密方案[J]. 信息安全与通信保密, 2009, 0(11): 100-102 |
| |
作者姓名: | 姜旗 张应辉 张涛 上官修凤 |
| |
作者单位: | 姜旗,张应辉,张涛(西安电子科技大学理学院,陕西,西安,710071);上官修凤(曲阜师范大学理学院,山东,曲阜,273165) |
| |
摘 要: | 利用椭圆曲线上的双线性对,提出一个基于身份的签密方案。在新方案中,接收者收到一个签密消息,在验证该消息签名的合法性后,再对消息进行恢复。在安全性方面,新方案具有机密性、不可伪造性、公开可验证性、鲁棒性;在计算量和通信成本方面,新方案中只需要进行1次模指数运算、2次双线性对运算和1次双线性对预运算,签密产生的密文长度为2|G1|+|m|,总成本比已有的基于身份的签密方案耗费少,从而有效实现了对消息的认证和保密。
|
关 键 词: | 签密 双线性对 基于身份的密码体制 公开可验证性 |
A New ID-Based Signcryption Scheme |
| |
Affiliation: | JIANG Qi, ZHANG Ying-hui, ZHANG Tao, SHANG GUAN Xiu-feng2(1School of Sience, Xidian University, Xi'an Shaanxi 710071, China 2School of Science, Qufu Normal University, Qufu Shandong 273165, China) |
| |
Abstract: | A new ID-based signcryption scheme is designed by using bilinear pairing on the Elliptic Curve. In this proposed scheme, the message is obtained after its validity being verified by the receiver. In addition, the new scheme is safe in confidentiality, unforgeability, public verifiability, and robustness. Compared with the existing ID-based signcryption schemes, the new scheme is more efficient in computational complexity and communication costs. Thus, the authentication and confidentiality of message is realized effectively. |
| |
Keywords: | signcryption bilinear pairing ID-based cryptosystem public verifiability |
本文献已被 维普 万方数据 等数据库收录! |
|