摘要
对Wang和Li提出的无可信中心的(t,n)门限签名方案[1]进行了安全性分析,指出该方案的群签名过程中存在一个严重的安全漏洞:即部分原始签名成员在生成密钥时合谋作弊,就能达到事后否认的目的,并对Wang和Li的代理多签名体制进行改进,将Chebyshev多项式与(t,n)门限签名体制相结合,提出了一种新的基于Chebyshev多项式的无可信中心(t,n)门限签名方案。
It is pointed out that there is a weakness in the （t, n） Threshold signature scheme without a trusted party proposed by Wang and Li , if several members collude together, they can deny that they had taken part in process of signing some messages with others. Furthermore, Chebyshev polynomial and the （t, n） threshold signature scheme are combined, and a new proxy multi-signature scheme based on Chevbyshev polynomial is proposed.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第21期4861-4863,共3页
Computer Engineering and Design
基金
广东省科技计划基金项目(20062006B15401002)
广州市科技计划基金项目(Z3-D0151)
