无随机预言模型的盲签名  

Blind signature without random oracles

作　　者：王静然[1] 钱海峰[1] 

机构地区：[1]华东师范大学计算机科学与技术系,上海200241

出　　处：《计算机应用研究》2010年第5期1837-1839,1844,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(60873217;60703004);国家教育部博士点基金资助(20070269005)

摘　　要：近些年来,盲签名的研究取得了很多的成果,但也存在着计算过程复杂、传输效率低、交互次数频繁等问题。基于Boneh等人提出的签名,首先给出一个不包含随机预言模型的盲签名方案。不包括随机预言机,盲签名就是一个可实现的安全的标准方案,而考虑到交互次数问题,该方案还可以引入公共参考串(common reference string,CRS)来完成签名方的非交互零知识证明,使得盲签名算法仅包含两次交互,实现了轮优先round optimal,在此基础上也可以实现盲签名算法的并发执行。该盲签名算法构造简单且计算复杂度较低,因此比现有的盲签名方案更加有效,节省了传输带宽,提高了传输效率。In recent years, the studies of blind signatures achieved a lot of results, but there still are many problems. Boneh and Boyen gave a new signature, derived the blind signature scheme from their idea. This paper first gave a blind signature without random oracles, with this property, the scheme was secure in standard model. Then, used common reference string to do non-interactive zero knowledge proof, made the blind signature into only two moves to achieve round optimal, and the concurrency operation of blind signature could be reach by this. For the algorithm is simple and not complicated, the blind signature is more efficient than the existing secure blind signature schemes,so save transmission bandwidth and improves transfer efficiency.

关 键 词：盲签名 随机预言机 盲性 不可伪造性 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]