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

Signature scheme based strong RSA assumption

作　　者：徐文华[1] 贺前华[1] 李韬[1] 

机构地区：[1]华南理工大学电子与信息学院,广东广州510641

出　　处：《华中科技大学学报（自然科学版）》2008年第12期24-26,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60572141)

摘　　要：针对基于强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.

关 键 词：数字签名 强RSA假设 签名预言机 可证明安全 自适应选择消息攻击 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]