论文部分内容阅读
以基于RSA体制的盲签名方案为讨论对象,将数字签名方案中的强不可伪造性引进到一般的盲签名中,给出了强盲签名方案的定义,并采用游戏归约调用证明方法将强盲签名方案的强不可伪造性攻击游戏与具有惟一性的盲签名方案的惟一性证明进行比较进而归约调用,得出结论:强盲签名方案与具有惟一性的盲签名方案是等价的,从而给出了具有惟一性的盲签名方案的更一般化的定义和判定方法,解决了判定一个盲签名方案是否具有惟一性的公开问题。
The blind signature scheme based on RSA is taken as the object of discussion, the strong unforgeability in the digital signature scheme is introduced into the general blind signature, the definition of the strong blind signature scheme is given, and the game reduction invocation method is adopted The strong unforgeability attack game of the blind signature scheme is compared with the uniqueness proof of the blind signature scheme with uniqueness and then transferred to the conclusion that the strong blind signature scheme is equivalent to the blind signature scheme with uniqueness, The more general definition and decision method of the blind signature scheme with uniqueness is given, which solves the open problem of determining whether a blind signature scheme has uniqueness.