计算机工程 ›› 2011, Vol. 37 ›› Issue (8): 140-142.doi: 10.3969/j.issn.1000-3428.2011.08.048

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

一个可证明安全的短环签密方案

孙 静,廖凯宁,王 伟   

  1. (安徽省地震局,合肥 230031)
  • 出版日期:2011-04-20 发布日期:2012-10-31
  • 作者简介:孙 静(1978-),女,工程师、硕士,主研方向:密码学,网络安全;廖凯宁,工程师、硕士;王 伟,工程师

Short Ring Signcryption Scheme with Provable Security

SUN Jing, MIAO Kai-ning , WANG Wei   

  1. (Seismology Bureau of Anfei Province, Hefei 230031, China)
  • Online:2011-04-20 Published:2012-10-31

摘要: 签密能在一个逻辑步骤内实现签名和加密2项功能。环签名允许一个群体内某成员匿名地泄露秘密。结合签密和环签名提出环签密概念。环签密既有保密性,又具认证功能。基于双线性对构造一个高效的短环签密方案。该方案允许发送者以匿名方式发送消息,使消息具有保密性和认证性。在随机预言模型下,证明该方案具有保密性和不可伪造性。

关键词: 环签密, 双线性对, 匿名性, 保密性, 认证性

Abstract: Signcryption is such a public key cryptographic primitive that simultaneously provides the functionality of signature and encryption within a single logic step. Ring signature allows a member in a group to anonymously leak a secret, namely anonymity. Combining the two notations of signcryption and ring signature together, it leads to a concept called ring signcryption. Ring signcryption is an important cryptographic primitive for private and authenticated communication. This paper proposes an efficient Short Ring Signcryption(SRSC) scheme based on bilinear pairings. In anonymous communications, the scheme allows the message sender to send the message anonymously, while the confidentiality and authenticity of the message are realized at the same time. It proves that the scheme is confidential and unforgeable in random oracle.

Key words: ring signcryption, bilinear pairing, anonymity, confidentiality, authentication

中图分类号: