摘要
分析了基于离散对数问题构造盲签名方案的一些文献中在对盲签名的强弱性分析方面存在的问题。通过证明任意一个合法的消息签名对,都能找到一组盲因子使之与某个盲消息签名对相联系,指出了以姚亦峰的二元仿射变换为构造思想,引入三元随机盲化参数得到的盲签名方案的强盲性证明中"基于离散对数难题"的这一论据是不成立的,重新给出了其强盲性的形式化证明;而使用二元随机盲化参数得到的盲签名方案为弱盲签名的论断是错误的,重新证明它也属于强盲签名。
Yao Yi-feng claims that according to his method of affine transform,the strong blind signature scheme is constructed when three blind variables are used,and the weak blind signature scheme is constructed when two blind variables are used.In this paper the authors prove that there is always a set of bind variables that make any two pairs of signed messages related,the blind schemes are always strong no matter two or three blind variables are used.Therefore,Yao Yi-feng＇s claim is incorrect,and his proof of the untraceability of the blind signature scheme using three blind variables is not very accurate.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第27期119-121,共3页
Computer Engineering and Applications
基金
973前期研究项目(No.2007CB316505)
关键词
数字签名
盲签名
强盲签名
弱盲签名
digital signature
blind signature
strong blind signature
weak blind signature
