一种新型的群盲签名方案

New type of group blind signature scheme

提出了一种新型的可证明安全性的群盲签名——ID群盲签名方案。与LR98群盲签名方案不同的是,新方案的安全性建立在计算Diffie-Hellman问题假设和随机预言机模型之上,并且用户在盲化签名者的内容时,算法效率比LR98高。在盲化CZK的ID群签名方案时,仅添加了模加运算,而LR98群盲签名方案在盲化CS97群签名方案时,则添加了求双重离散对数、离散对数根以及随机置换运算。两者比较,新提出方案的计算复杂度更低,效率更高。

This paper constructed a provably secure ID-based group blind signature scheme on the basis of CZK＇ s ID-based group signature scheme. The security of the new scheme was based on the computational Diffie-Hellman assumption under the random oracle model, of which was different from the scheme of LR98. In the mean time, the efficiency of the user to blind the content of the signer was improved. To blind the group signature of CZK, only added the computation of modular addition ; while the scheme in LR98 added the computation of double discrete logarithm, root of the discrete logarithm and random permutation in order to blind the group signature of CS97. As a result, the new scheme is much lower than the one in LR98 with respect to computation complexity and higher with respect to efficiency.