计算机工程 ›› 2012, Vol. 38 ›› Issue (9): 141-143,161.doi: 10.3969/j.issn.1000-3428.2012.09.042

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

无可信中心的可公开验证签密方案

张小萍,钟 诚   

  1. (广西大学计算机与电子信息学院,南宁 530004)
  • 收稿日期:2011-08-31 出版日期:2012-05-05 发布日期:2012-05-05
  • 作者简介:张小萍(1978-),女,讲师、硕士、CCF会员,主研方向:网络信息安全,电子商务;钟 诚,教授、博士
  • 基金项目:
    2007年度广西教育厅基金资助项目(200708LX359); 广西高校人才小高地建设创新团队资助计划基金资助项目(桂教 人[2007]71号)

Public Verifiable Signcryption Scheme Without Trusted Center

ZHANG Xiao-ping, ZHONG Cheng   

  1. (School of Computer and Electronic Information, Guangxi University, Nanning 530004, China)
  • Received:2011-08-31 Online:2012-05-05 Published:2012-05-05

摘要: 可公开验证的基于身份签密方案大多因密钥托管问题存在安全漏洞。针对该问题,提出一个无可信中心的可公开验证签密方案。通过加入一个可由签名者自选并对私钥产生中心(PKG)保密的秘密值作为部分私钥,使不诚实的PKG无法伪造用户签密或擅自解密恢复明文。分析结果表明,该方案在随机预言模型下可以抵抗适应性选择消息和身份的存在性伪造攻击,并具有保密性和可追踪性。

关键词: 签密, 基于身份, 无可信中心, 可公开验证, 双线性对, 保密性

Abstract: Most ID-based signcryption schemes with public verifiability have security problems because of key escrow. So this paper proposes a public verifiable ID-based signcryption scheme without trusted Private Key Generator(PKG). A secret value chosen by signer is added as the partial private key, so that dishonest PKG can not forge the signature of user or decrypt and restore plaintext without authorization. Security analysis shows that the proposed scheme is secure against existential forgery on adaptively chosen massage and identity attack under the random oracle model, and it has the properties of confidentiality and traceability.

Key words: signcryption, ID-based, without trusted center, public verifiable, bilinear pairing, confidentiality

中图分类号: