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. ...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.展开更多
部分盲签名通过在最终的签名数据中添加签名者和用户协商的公共信息,较好地解决了盲签名在匿名性和可控性之间的矛盾。基于Shim(SHIM K A.An ID-based aggregate signature scheme with constant pairingcomputations.The Journal of Sy...部分盲签名通过在最终的签名数据中添加签名者和用户协商的公共信息,较好地解决了盲签名在匿名性和可控性之间的矛盾。基于Shim(SHIM K A.An ID-based aggregate signature scheme with constant pairingcomputations.The Journal of Systems and Software,2010,83(10):1873-1880)提出的基于身份的数字签名方案,提出了一个新的可证安全的基于身份的部分盲签名方案。在随机预言机模型下证明了新方案对自适应选择消息和身份攻击是存在不可伪造的,其安全性能够归约为计算Diffie-Hellman假设。与目前已有的随机预言机模型下基于身份的部分盲签名方案相比,所提方案具有较高的运算效率和较少的通信量。展开更多
文摘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.
文摘部分盲签名通过在最终的签名数据中添加签名者和用户协商的公共信息,较好地解决了盲签名在匿名性和可控性之间的矛盾。基于Shim(SHIM K A.An ID-based aggregate signature scheme with constant pairingcomputations.The Journal of Systems and Software,2010,83(10):1873-1880)提出的基于身份的数字签名方案,提出了一个新的可证安全的基于身份的部分盲签名方案。在随机预言机模型下证明了新方案对自适应选择消息和身份攻击是存在不可伪造的,其安全性能够归约为计算Diffie-Hellman假设。与目前已有的随机预言机模型下基于身份的部分盲签名方案相比,所提方案具有较高的运算效率和较少的通信量。
基金Supported by the National Natural Science Foundation of China under Grant No.60673075the Doctoral Program Foundation of Chinese Ministry of Education under Grant No.20050614018~~
