没有对运算的无证书环签密方案的设计  

Certificateless ring signcryption scheme without paring design

作　　者：覃海生[1] 张雷[1] 冯燕强[1] 何传波[1] 吴文俊[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

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

基　　金：广西壮族自治区教育厅基金项目(20100712);广西南宁市科学技术局科技攻关基金项目(20100791)

摘　　要：为了改进原有签密方案的缺点和提高签密效率,研究总结现有无证书环签密方案,提出了一种没有对运算的环签密方案模型,并给出了基于离散对数具体设计方案。分析原有环签密方案的特性,保留原有方案的优点,同时相对于原有方案,去除双线性对运算的使用,所以新方案大大提高了效率。实验结果表明,该方案不仅具有无证书环签密方案的匿名性、安全性、保密性、不可伪造性,而且还具有身份可验证性和高效率性。To improving the disadvantage of original signcryption scheme, the existing certificateless signcryption schemes are analyzed and concluded and a new certificateless ring signcryption model without using the bilinear parings is proposed and the designing scheme based on discrete logrithm is presented. Firstly, the characteristics of original ring signcryption scheme are analyzed, and the advantages of original scheme are retained. At the same time, compared with the original scheme, the new scheme greatly improves efficiency because of removing of bilinear pairing. The results show that this scheme not only takes on signcrypter anonymity, security, confidentiality, unforgeability, but also has identity verifiablity and efficientibility.

关 键 词：离散对数 无证书 环签密 CDH问题 双线性对 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]