论文部分内容阅读
为了克服已有方案安全性依赖强、签名长度长、计算代价大等缺陷,提出了一种可将任意基于身份的具有分割-可模拟的存在性不可伪造的方案转化为强不可伪造签名方案的转化方案;在Paterson方案的基础上设计了标准模型下一种有效的基于身份的强不可伪造签名.在计算Diffie-Hellman困难问题的假设下,证明该方案在适应性选择消息攻击下是强存在性不可伪造的.与已有基于身份的强不可伪造签名方案相比,该方案签名长度短,计算量小,且有更强的安全性.
In order to overcome the shortcomings of the existing schemes, such as strong dependence on security, long signature length and high computational cost, a new scheme is proposed to convert any identity-based fragmented-mockable existence unforgeable scheme into a strong unforgetable signature scheme Transformation scheme and an effective identity-based strong unforgetable signature based on the Paterson scheme is designed.Under the assumption of Diffie-Hellman problem, this scheme is proved to be strong under the attack of adaptive selective message Which can not be forged.Compared with the existing strong identity-based unforgetable signature scheme, this scheme has the advantages of short signature length, low computational complexity and more security.