ACJT群盲签名方案

ACJT Group Blind Signature Scheme

提出了一种新型的ACJT群盲签名方案。与LR98群盲签名方案不同的是,新方案的安全性建立在强RSA以及判定性Diffie-Hellman假设之上,并且用户在盲化签名者的内容时,效率得以提高。在盲化ACJT群签名方案时,仅添加了模指数和模加运算,而LR98群盲签名方案在盲化CS97群签名方案时,则添加了求双重离散对数、离散对数根以及随机置换运算。二者比较,该文提出的方案计算复杂度更低,效率更高。

This paper constructs a new group blind signature scheme on the basis of ACJT group signature scheme. The security of the new scheme is based on the strong RSA assumption and the decisional Diffie-Hellman assumption, of which is different from the scheme of LR98. In the mean time, the efficiency of the user to blind the content of the signer is improved. To blind the group signature of ACJT, this paper only adds the computation of modular exponentiation and modular addition; while the scheme in LR98 adds 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 scheme proposed by this paper is much lower than the one in LR98 with respect to computation complexity and higher with respect to efficiency.