摘要
环签名作为一种匿名通信技术,可以使签名人具有匿名性。在以往提出的环签名方案中,签名长度与环成员个数成正比,这是环签名的一个公开问题。该文使用双线性对,并基于累加器技术,提出了一种签名长度固定的基于身份的环签名方案,并证明了其安全性。方案既能保证消息发送者的匿名性,又可使得到的签名长度与环成员个数无关,解决了环签名的公开问题。
The ring signature is one of the anonymous techniques by virtue of its unconditional anonymity. Most proposed ring signature schemes have the problem that the size of ring signatures depends linearly on the group size, That is an open problem. In this paper, new scheme called constant-size ring signatures is presented, The scheme is based on bilinear pairings and accumulators, In the scheme, users can send messages anonymously, and the size of the signature is independent of the group size. Therefore, the scheme proposed can be used to solve the open problem.
出处
《电子与信息学报》
EI
CSCD
北大核心
2007年第11期2645-2648,共4页
Journal of Electronics & Information Technology
基金
黑龙江省自然科学基金(F2004-06)
哈尔滨工程大学基础研究基金(HEUFT05067)资助课题
