一种加强的基于中国剩余定理的群签名

An Enhanced Group Signature Scheme Based on Chinese Remainder Theorem

陈泽文等在2004年提出了基于中国剩余定理的群签名方案。该方案在加入或撤销群成员时其他群成员密钥和群公钥的长度保持不变,从而解决了撤销群成员的困难,提供了一种效率高和计算复杂度小的群签名方案。从该方案的研究中发现其基于RSA算法的方案不具有防陷害性和不可伪造性的特征。因此,参照ElGamal的算法,提出了一种加强的基于中国剩余定理群签名的新方案。在新方案中,保证了原有算法在加入和撤销成员具有高效性的同时,进一步改进了陈方案的不足,不再要求可信的群中心,并且群成员也分担了群中心的工作量,使系统更具有实效性。

The group signature scheme based on Chinese remainder theorem was proposed by Chen Zewen etc in 2004. Chen＆#39;s scheme can keep the secret key of other members and the length of group public key unchanged when joining or canceling a group member,thus, the scheme has solved the problem of withdrawal for the group members and provided a kind of group signature scheme with high effi-ciency and small computational complexity. In research on the plan,found that the scheme based on RSA algorithm does not have the a-bility to prevent the frame and fake. Therefore,with the reference to the ElGamal algorithm,a new scheme is put forward which is a kind of strengthening signature based on Chinese remainder theorem. In the new scheme,it can ensure the high efficiency when joining or can-celing a group member as the original algorithm. At the same time,the group center does not have to be a trusted and the group members also share the workload of group center,making the system more effective.