带门限值的多重签名方案  

Multisignature Scheme with Threshold Value

作　　者：张青坡[1] 陈鲁生[1] 王晓明[2] 

机构地区：[1]南开大学数学科学学院,天津300071 [2]暨南大学计算机系,广州510632

出　　处：《计算机工程》2007年第2期15-17,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60172060)

摘　　要：现有的多重签名方案和门限签名方案都不允许任何签名成员产生错误的签名,然而在现实世界里,有很多情形并不需要所有签名者都给出正确的签名。该文提出了一种新的带门限值的多重签名方案。在新方案中,允许某些签名者弃权或者产生错误的签名,只要有效的单用户签名数不小于事先规定的门限值,即可产生有效的多重签名。与现有的门限签名方案相比,新方案中门限概念的实现并没有借助Shamir的秘密共享技术,新方案中的门限值可方便地进行更改,并可抵抗针对秘密共享技术的相应攻击。None of the signers is allowed signing wrong signatures in all of the existing multisignature schemes and threshold signature schemes. In some cases however, it is not necessary that all of the signers sign correct signatures, So a new multisignature scheme with threshold value is presented. In the new scheme, some of the signers can abstain or sign wrong signatures. The valid multisignature can be made as long as the number of the valid member signatures is not less than the threshold value. Without combining with the Shamir＇s threshold scheme, the threshold value in the new scheme can be changed conveniently and it can defend against the corresponding attacks to the secret sharing scheme.

关 键 词：数字签名 多重签名 门限值 门限签名 秘密共享 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]