基于Mignotte’s列的(t,n)门限群签名方案

Abstract

电子学报中曾提出了一个在不改变其他有效群成员的签名密钥的情况下,可安全快速地加入或删除群成员的群签名方案。但此方案没有涉及到实际运用中需要设置门限的情况,现对原方案做了改进和推广,保留了原方案中可安全快速地加入或删除群成员的优点,推广到了每次参与签名人数变动较大,并需要设置门限的情况,利用中国剩余定理提出了一个新的基于Mignotte’s门限秘密共享方案的(t,n)门限群签名方案。

A group signature scheme that can enlist in and delete a group member safely and quickly without changing the secret keys of other available group members has been proposed in Electronic Journal.The scheme did not deal with the situation of setting threshold.This paper presents a new threshold group signature scheme by extending the Chen Ze-wen's construction.The scheme based on Mignotte's sequence makes use of the Chinese remainder theorem.