Proofs of Security for Improved Rabin Signature Scheme  

作　　者：董晓蕾 陆荣幸 曹珍富 

机构地区：[1]Dept. of Computer Science and Eng., Shanghai Jiaotong Univ., Shanghai 200030, China

出　　处：《Journal of Shanghai Jiaotong university(Science)》2006年第2期197-199,204,共4页上海交通大学学报（英文版）

基　　金：NationalNaturalScienceFoundationofChina(Nos.60225007,60572155)andScienceandTechnologyResearchProjectofShanghai(Nos.04JC14055,04DZ07067)

摘　　要：The improved RSA signature scheme can be strictly proved to be equivalent to the factoring problem. In the improved RSA signature scheme, when the public exponent e=1, the scheme becomes the improved Rabin signature. Such an improved Rabin signature scheme is reviewed and the techniques from the provable security is applied to analyze its security.The improved RSA signature scheme can be strictly proved to be equivalent to the factoring problem. In the improved RSA signature scheme, when the public exponent e= 1, the scheme becomes the improved Rabin signature. Such an improved Rabin signature scheme is reviewed and the techniques from the provable security is applied to analyze its security.

关 键 词：digital signature improved Rabin signature provable security  random oracle model 

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