基于身份的可验证环签密方案  

Identity based verifiable ring signcryption scheme

作　　者：邓伦治[1] 杨焱[1] 

机构地区：[1]贵州师范大学数学与计算机科学学院,贵州贵阳550001

出　　处：《计算机工程与设计》2013年第3期845-848,共4页Computer Engineering and Design

基　　金：贵州师范大学联合基金项目(黔科合J字LKS[2010]02号)

摘　　要：为了同时实现匿名加密,认证和可验证3种功能,提出了一个基于身份的可验证环签密方案,并在随机预言模型下证明了其安全性。在该方案中,任何人能任意的选择n-1个成员,加上他自己构成一个群,代表这个群生成一个签密,保持真实签密者的匿名性,同时如果真实的签密者愿意向接收者证实他自己就是签密者,那接收者能够正确的检验出这是否是事实。该方案在签密阶段只需要1次双线性对的计算,解密阶段也只需要3次双线性对计算,因此这是一个安全且高效的方案。To achieve anonymous encryption, authentication and verification simultaneously, an identity-based verifiable ring signcryption scheme is proposed and the scheme is proved to be security under the random oracle model. In the scheme, anyone spontaneously conscript arbitrarily n -- 1 entities to form a group including himself and generate a ring signcryption on behalf of the group, yet the actual signcrypter remain anonymous. If the actual signcrypter is willing to prove to the receiver that he made the signcryption, then the receiver can correctly determine whether that is the fact. In the scheme, it does need 1 pairing operation in signcryption, need 3 pairing operations in unsigncryption. Thus it is a safe and efficient scheme.

关 键 词：基于身份密码 环签密 可验证 双线性对 随机预言模型 

分 类 号：TN918[电子电信—通信与信息系统]