一种基于身份的环签密方案  

An Identity-Based Ring Signcryption Scheme

作　　者：黄欣沂[1] 张福泰[1] 伍玮[1] 

机构地区：[1]南京师范大学数学与计算机科学学院,江苏南京210097

出　　处：《电子学报》2006年第2期263-266,共4页Acta Electronica Sinica

基　　金：江苏省高校自然科学研究重点项目(No.03KJA520066);"十五""211"工程重点学科项目(No.181070H901)

摘　　要：使用威尔配对,本文提出了一种基于身份的环签密方案,给出了具体的算法.该方案能够使消息的发送者以一种完全匿名的方式发送消息,并且同时实现保密性和认证性两种功能.我们证明了在决策双线性D iffie-Hell-m an问题难解的假设下,新提出的方案对自适应选择密文攻击是安全的.与传统的先签名后加密的方案相比,本方案中密文长度有了明显的降低,在低带宽的要求下更加可行.Using weil pairing, an identity-based ring signcryption scheme is proposed. Its concrete algorithm is given, Using this scheme the message sender can anonymously send the message, the confidentiality and authenticity of message are realized at the same time. It is proved that the scheme is secure against adaptively chosen cipher text attack under the difficulty of the Decisional Bilinear Diffie-Hellman problem. Compared with the traditional ＂signature then encryption scheme＂, the cipher text of our scheme is rather short. So our scheme is more applicable to systems where cryptogram is sent over a low bandwidth channel.

关 键 词：威尔配对 Diffie—Hellman问题 身份 环签密 

分 类 号：TB11[理学—数学]