針對現(xiàn)有的(t,n)門限簽名方案中所存在的當群內(nèi)任何t個或更多個秘密分享成員聯(lián)合攻擊，能暴露系統(tǒng)的秘密密鑰的問題，設(shè)計了一種能抵制群內(nèi)成員聯(lián)合攻擊的可證實的具有系統(tǒng)穩(wěn)定性的門限簽名方案。該方案的安全性是基于求離散對數(shù)和RSA大整數(shù)因式分解的困難，其群簽名長度和群簽名的驗證時間只相當于一般個人簽名。
關(guān) 鍵 詞 門限群簽名; 可驗證性; 高效性; 離散對數(shù); 因式分解問題

Abstract Group oriented (t,n) threshold digital signature schemes have a problem in that the underlying signature schemes will be broken if any t or more shadowholders conspire together with each other,thus the group secret key will be revealed.The new scheme proposed by us can avoid the conspiracy attack.It is based on the difficulty of computing the discrete logarithm modulo for a composite number and the factorization problem of large integer.The size of the group signature and verification time of the group signature are equivalent to that of an individual signature.
Key words threshold group signature; verification; efficiency; discrete logarithm; factoring problem