【作者】 张键红； 冀承；

【Author】 Jianhong Zhang Cheng Ji (College of Science,North China University of Technology,Beijing 100041,China)

【机构】 北方工业大学理学院；

【摘要】 作为一种匿名的数字签名,盲签名可以保护客户或投票者的隐私权不受侵犯,在匿名电子货币,匿名电子投票等领域的有着广泛的应用,在本文基于离散对数问题的困难性提出了两种新的短盲签名方案,并且运用分叉引理对其安全性进行了分析,展示出我们的方案是安全的：通过与赵的方案[11]进行比较,发现我们所建议的两种方案无论计算复杂性上还是签名长度上都优于该方案,我们所建议的两种签名长度仅仅为320bits,与 DSA 的签名长度相等。因而,我们的方案是有效的。更多还原

【Abstract】 As a kind of anonymous digital signature,blind signature can protect the privacy of the customer or the voter and has widely applications in the fields of anonymous e-cash and anonymous e-voting.In this paper,two short blind signature schemes based on discrete logarithm are proposed and the security of them are analyzed by forking lemma. Comparing with Zhao’s scheme[11],we show that the amount of computation and the size of signature of our schemes are better than Zhao’s,the size of the signature of our schemes are both 320 bits,the same as the signature length of DSA.So our schemes are efficient.更多还原