吉林大学学报（信息科学版）2011，Vol.29Issue(3)：207-212,6.
标准模型下基于(q/2n)-SDH难题的数字签名算法
Efficient Signature Scheme Based on(q/2n)-SDH Assumption in the Standard Model
康立1
作者信息
- 1. 西南财经大学经济信息工程学院,成都610074
- 折叠
摘要
Abstract
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/ 2n) -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.关键词
数字签名/强不可伪造安全/强Diffie-Hellman难题Key words
digital signature/strongly unforgeable security/q-SDH分类
信息技术与安全科学引用本文复制引用
康立..标准模型下基于(q/2n)-SDH难题的数字签名算法[J].吉林大学学报（信息科学版）,2011,29(3):207-212,6.
