摘要
该文将秘密分享方案与ELGam al数字签名方案结合起来提出一种新的门限共享验证签名方案,并对该方案进行了分析。该方案的n个验证者中任意t个可以验证签名的有效性,而少于t个验证者不能验证签名的有效性。分析表明,本文的构造方案不仅具有较好的安全性和较低的计算复杂度,而且还具有如下特点:(1)签名者的私钥可以重复使用,签名不可伪造;(2)进行多次验证签名而不会暴露验证者的秘密份额以及验证者之间不能相互伪造验证信息,从而验证者可以使用相同秘密份额对多个签名进行验证。这些特点使得方案中的签名私钥和验证秘密份额都具有可重复使用性。
A new threshold shared verification signature scheme is proposed based on secret sharing scheme and ELGamal digital signature,in which any t among n verifiers can verify the validness of signature,otherwise they can＇t. According to analysis,on one hand,the proposed scheme in the paper has better security and less computation complexity.On the other hand,the scheme has the following features： （1）The private key of signer can be used repeatedly and it is very difficult to forge a signature.（2）Signature can be verified for many times without exposing verifiers＇ secret shares and there is little possibility that information of verification can be forged among verifiers. Therefore verifiers can deal with dozens of signatures with the same secret shares.The features promise that private key of signer and secret shares can be used repeatedly.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第30期63-65,68,共4页
Computer Engineering and Applications
关键词
数字签名
中国剩余定理
门限共享验证签名
秘密分享
digital signature, Chinese remainder theorem, threshold shared verification signature, secret sharing
