欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了克服已有方案安全性依赖强、签名长度长、计算代价大等缺陷，提出了一种可将任意基于身份的具有分割一可模拟的存在性不可伪造的方案转化为强不可伪造签名方案的转化方案；在Paterson方案的基础上设计了标准模型下一种有效的基于身份的强不可伪造签名．在计算Diffie—Hellman困难问题的假设下，证明该方案在适应性选择消息攻击下是强存在性不可伪造的．与已有基于身份的强不可伪造签名方案相比，该方案签名长度短，计算量小，且有更强的安全性．
英文摘要：
To overcome the shortcomings of the existing schemes such as strong hardness assumption,long signatures and high compution cost, a new transformation is proposed. It can convert any simulative-parti- tioned identity-based signature with existentially unfor~eable security to a strongly unforgeable signature. And a concrete strongly unforgeable identity-based signature based on Paterson＇ s scheme is constructed in the standard model. Under computational Diffie-Hellman assumption, the proposed signature scheme is provably secure against strongly existential forgery under adaptive chosen message attacks. In addition, the new scheme has some advantages over the available schemes, such as short signatures, low computation cost and high security.
同期刊论文项目
同项目期刊论文
期刊信息
位置：