Abstract:
The existing ID-based signcryption schemes have some drawbacks, such as the signcryption can not be public verified, the signcryption can be forged, the signcryption is not robust, and etc. This paper analyzes the security of the LHL scheme and adopts the bilinear parings to propose an ID-based signcryption scheme. This scheme can ensure the signcryption has some characters, such as public verifiability, unforgeability, robustness, non-repudiation and forward security. It only needs four pairs of operation and it is more efficient than other ID-based signcryption schemes.
Key words:
signcryption,
ID-based,
bilinear parings,
robustness
摘要: 现有基于身份的签密方案存在签密不能被公开验证、签密能被伪造和签密不具有健壮性等缺陷。分析LHL方案的安全性,利用双线性对提出一个基于身份的签密方案,该方案能保证签密具有公开验证性、不可伪造性、健壮性、不可否认性和前向安全性,它只需要4个对运算,其效率高于其他基于身份的签密方案。
关键词:
签密,
基于身份,
双线性对,
健壮性
CLC Number:
LI Xiao; HE Ming-xing; LUO Da-wen. ID-based Signcryption Scheme[J]. Computer Engineering, 2009, 35(22): 144-146.
李 虓;何明星;罗大文. 基于身份的签密方案[J]. 计算机工程, 2009, 35(22): 144-146.