一个高效的无双线性对环签名  

An Efficient Ring Signature without Bilinear Pairing

作　　者：巫朝霞[1] 张瑛瑛 WU Zhaoxia;ZHANG Yingying(Department of Applied Mathematics,Xinjiang University of Finance and Economics,Urumqi Xinjiang 830054,China;School of Sciences,Chongqing University of Posts and Telecommunications,Chongqing 400064,China)

机构地区：[1]新疆财经大学应用数学学院,新疆乌鲁木齐830011 [2]重庆邮电大学理学院,重庆400065

出　　处：《新疆大学学报（自然科学版）》2018年第4期473-478,共6页Journal of Xinjiang University(Natural Science Edition)

基　　金：新疆省部级课题(2014211A001)

摘　　要：环签名是一个不具有任何管理者的类群签名,它具有保护签名者身份的作用.本文,我们利用Schnorr签名思想设计出一个高效的环签名方案,并给出具体算法.因为具有Schnorr签名方案的特点,对比发现此方案在计算效率上比多数环签名方案更高效、更安全.在随机预言模型下证明了该方案的不可伪造性以及无条件匿名性,其在电子商务应用中具有广泛的前景.Ring signature is a group-oriented signature without any manager,which is designed.to protect the anonymity of the signer.In this paper,we propose an efficient ring signature by using the idea of Schnorr's signature.Because of owing the features of Schnorr's signature,the ring signature scheme we proposed is more efficient in computation compared with the some previous ring signature schemes.We also prove that our scheme is unforgettable in the random oracle model.It has a broad prospect in the application of electronic commerce.

关 键 词：环签名 公钥密码系统 双线性对 随机预言模型 

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