作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (22): 144-146. doi: 10.3969/j.issn.1000-3428.2009.22.049

• 安全技术 • 上一篇    下一篇

基于身份的签密方案

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

  1. (1. 西华大学数学与计算机学院,成都 610039;2. 西南交通大学信息编码与传输四川省重点实验室,成都 610031)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-20 发布日期:2009-11-20

ID-based Signcryption Scheme

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

  1. (1. School of Mathematics and Computer Engineering, Xihua University, Chengdu 610039;2. Key Laboratory of Information Coding and Transmission, Sichuan Province, Southwest Jiaotong University, Chengdu 610031)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-20 Published:2009-11-20

摘要: 现有基于身份的签密方案存在签密不能被公开验证、签密能被伪造和签密不具有健壮性等缺陷。分析LHL方案的安全性,利用双线性对提出一个基于身份的签密方案,该方案能保证签密具有公开验证性、不可伪造性、健壮性、不可否认性和前向安全性,它只需要4个对运算,其效率高于其他基于身份的签密方案。

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

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

中图分类号: