摘要
基于RSA和哈希函数求逆的困难性给出了两种多重数字签名方案,一种是可验证的按序数字多重签名,另一种是广播数字签名。在该两种方案中签名的长度不随签名者的人数线性增长,并且能够抵制各种勾结,具有计算量少、通信量低等特点。
We propose two digital multi-signature schemes based on difficulty of RSA and hash fimction. One is a verifiably sequential multi-signature ,the other is a broadcasting multi-signature. The size of signature don't increase with signer number in those two schemes. The two schemes can resist coalition and have advantages of less computation and communication and so on.
出处
《通信学报》
EI
CSCD
北大核心
2003年第8期150-154,共5页
Journal on Communications
基金
国家自然科学基金资助项目(19931010)
关键词
多重数字签名
按序签名方式
可验证性
广播签名
digital multi-signature
sequential multisignature
verifiable
broadcasting multisignatures