计算机与现代化 ›› 2009, Vol. 8 ›› Issue (8): 137-139.doi: 10.3969/j.issn.1006-2475.2009.08.038

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

可证明安全的基于ID的无可信中心签名方案

陈华1,2,蔡光兴1   

  1. 1.湖北工业大学理学院,湖北 武汉430068;2.武汉大学数学与统计学院,湖北 武汉430068
  • 收稿日期:2009-05-07 修回日期:1900-01-01 出版日期:2009-08-21 发布日期:2009-08-21

Provably Secure ID-based Signature Scheme Without Trusted Party

CHEN Hua1,2,CAI Guang-xing1   

  1. 1.School of Science, Hubei University of Technology, Wuhan 430068, China;2.School of Mathematics and Statistics, Wuhan University, Wuhan 430068, China
  • Received:2009-05-07 Revised:1900-01-01 Online:2009-08-21 Published:2009-08-21

摘要: 针对现有的基于身份签名系统的密钥托管问题,提出了一种新的基于身份的无可信中心签名方案。新方案通过将两个部分公钥绑定相同的一个身份,从而解决了密钥托管问题。在随机预言模型下,基于CDHP困难问题,新方案被证明能够抵抗适应性选择消息和身份的存在性伪造攻击。

关键词: 基于身份的签名方案, 密钥托管问题, 无可信中心, 双线性对, 随机预言模型

Abstract: An efficient IDbased signature scheme without trusted party is proposed, against the problem of key escrow of IDbased signature system. The new scheme could solve the key escrow problem through binding two partially public keys with a same identity. Under the random oracle model, it has been proved secure against existential forgery on adaptively chosen message and ID attack based on the hardness of the computation diffiehellman problem(CDHP). 

Key words: ID-based signature scheme, key escrow, non-trusted party, bilinear parings, random oracle model

中图分类号: