基于强RSA假设的数字签名方案

Signature scheme based strong RSA assumption

针对基于强RSA(Riverst,Shamir,Adleman)假设的数字答名方案,首先通过哈希函数潜在性质分析现有方案的安全缺陷,然后通过删除冗余参数x和采用一个生成元简化签名方案,最后在强RSA假设和签名预言机模型下证明该方案是安全的.新方案弥补了安全漏洞,比以往的方案更简洁、高效且安全.

A digital signature scheme was proposed to resolve these problems in date integrality of the current schemes based on strong RSA （Rivest, Shamir, Adleman） assumption. The potential feature of the hash function was analyzed first to demonstrate the date integrality weakness, and then only one generator was captive and the redundancy parameter removed to simplify the proposed scheme. The security of the scheme was illuminated based on the strong RSA assumption and the sign oracle model. The new scheme is more sententious andefficient, and the security is provable.