摘要
为解决标准模型下可证明安全的数字签名方案安全性归约为q-SDH难题的不足,给出一个改进算法:在增加少量签名长度的条件下大大缩小q-SDH难题中的q参数;算法能灵活选择q-SDH难题中的q参数而不降低算法的安全性,当q-SDH难题变为(q/2n)-SDH难题后,新签名算法的安全性将得到提高并且能在非随机预言机模型下得到安全证明。
One drawback of their schemes is that they employed a q-SDH assumption to prove their scheme's security. There is an interesting improvement algorithm that greatly reduces the q parameter in q-SDH assumption on slightly increasing the signature size. It introduces a flexibility in choosing the parameter q in the SDH assumption without compromising in security. Quite the contrary, when the q-SDH assumption decreases to (q/2^n ) -SDH assumption, the security of the signature scheme will be improved, and the new signature scheme's security can be proven without the random oracles.
出处
《吉林大学学报(信息科学版)》
CAS
2011年第3期207-212,共6页
Journal of Jilin University(Information Science Edition)