一种新的有效的群签名方案

A New Efficient Group Signature Scheme

介绍了一种有效的群签名方案。该方案的安全性是基于译码问题的难度和线性码的纠删特性和ElGamal签名方案的安全性。已知[n,k,d]码和相应的数字签名方案,则签名和群公钥的长度分别是n+5和n2+5。对于方案的计算代价,签名过程除O(n)算术运算外基本上与ElGamal方案相同;打开签名的过程非常有效,只需O(d2)运算量。方案允许新成员加入群时不修改群公钥。通过向某些成员分发新的成员资格证书,可以将成员从群中删除。

An efficient group signature scheme is presented. The security of this scheme is based on the difficulty of the decoding problem of linear codes, and the security of the ElGamal signature scheme. For a given code and the corresponding group signature scheme, the lengths of the signatures and the group public key are and respectively. With regard to the computational overhead of this scheme, the signing process is basically the same as the ElGamal scheme but arithmetic operations; the procedure of opening a signature is very efficient and needs only arithmetic operations. This scheme allows new members to join a group without modifying the group public key. By distributing new membership certificates to some members, a member can be deleted from a group.