强盲签名与惟一盲签名的等价性  

The equivalence of strong blind signature and unique blind signature

作　　者：蔡杰[1,2] 秦静[1] 韩斐[1] 

机构地区：[1]山东大学数学学院,山东济南250100 [2]山东英才学院基础部,山东济南250104

出　　处：《山东大学学报（理学版）》2013年第5期57-62,共6页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(60873041;61272091);山东省自然科学基金面上项目(ZR2012FM005);济南市科技局高校院所自主创新项目(201202009)

摘　　要：以基于RSA体制的盲签名方案为讨论对象,将数字签名方案中的强不可伪造性引进到一般的盲签名中,给出了强盲签名方案的定义,并采用游戏归约调用证明方法将强盲签名方案的强不可伪造性攻击游戏与具有惟一性的盲签名方案的惟一性证明进行比较进而归约调用,得出结论:强盲签名方案与具有惟一性的盲签名方案是等价的,从而给出了具有惟一性的盲签名方案的更一般化的定义和判定方法,解决了判定一个盲签名方案是否具有惟一性的公开问题。Focused on the Chaum＇s RSA-based blind signature scheme and introduced the strong un-forgeability in blind signature,a new class of blind signature schemes called strong blind signature scheme was presented.A conclusion was proposed which the strong blind signature and the unique blind signature were equivalent by using game reduction and comparing the un-forgeable attack game of strong blind signature schemes with that of the unique blind signature schemes.From this conclusion,more general secure definition and determinant methods for the unique blind signature schemes were proposed,so the open problem that how to decide the unique blind signature schemes was solved.

关 键 词：盲签名 强不可伪造性 惟一性 强盲签名 one-more-forgery 

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