计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (33): 65-67.

• 网络、通信、安全 • 上一篇    下一篇

基于身份的门限环签密方案

罗大文,何明星,李 虓   

  1. 西华大学 数学与计算机学院,成都 610039
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-11-21 发布日期:2011-11-21

ID-based threshold ring signcryption scheme

LUO Dawen,HE Mingxing,LI Xiao   

  1. School of Mathematics and Computer Engineering,Xihua University,Chengdu 610039,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-11-21 Published:2011-11-21

摘要: 把基于身份的环签密和门限签名结合起来,提出了一个基于身份的门限环签密方案。此方案不但具有签密的一般性质:机密性和认证性,还具有签密者的匿名性和门限性质。在CDHP、DBDHP困难性假设下,分别证明了方案在适应性选择消息攻击下的不可伪造性以及在适应性选择密文攻击下的不可区分性。

关键词: 环签名, 门限环签密, 计算性Diffie-Hellman问题(CDHP), 决定性双线性对Diffie-Hellman问题(DBDHP)

Abstract: An ID-based threshold ring signcryption scheme is proposed.It is based on the concepts of ID-based ring signcryption scheme and threshold signature scheme.The scheme not only has the properties of signcryption:confidentiality and authentication,but also has the properties of ring signcryption and threshold signature.The existential unforgeability against adaptive chosen message attacks is proved to depend on the hardness of CDHP.The indistinguishability against adaptive chosen ciphertext attacks is proved to depend on the hardness of DBDHP.

Key words: ring signature, threshold ring signcryption, Computational Diffie-Hellman Problem(CDHP), Decisional Bilinear Diffie-Hellman Problem(DBDHP)