Research On Signature Schemes With Message Recovery

With the development of computer-internet technology, information security becomes an important problem. Digital signature technology has become the key of information security, and has been used in more and more areas. There are many kinds of digital signature with special application. Such as:digital signature with message recovery, threshold-signature, group signature, ring signature and so on. In the paper, we had been studied digital signature schemes with message recovery based on all kinds of hard problem. We had done some work as bellow:1) The message recovery signature scheme in Zhao Zemao's paper is not secure. Anyone who doesn't know the private key of Bob's can recover the message, and present a forgery attack on the scheme. In the paper, we propose an improved scheme, and give a security analysis of our scheme. The new signature scheme has not the security problem above. Finally, the new scheme is popularized.2) Recently, the research about digital schemes with message recovery based on double hard problems is seldom. The computational efficiency and transmission efficiency of the schemes existed is too low. Hence, in the paper, a new digital signature scheme with message recovery is given, the security about it is based on the difficulties of computing discrete logarithms and factoring. Then giving its security analysis and efficiency analysis. The security of the scheme is consequently better than those of the signature schemes which are based on the difficulty of a single problem. And the scheme proposed has higher efficiency than the schemes which are existed now. The scheme with links-message recovery is given, when the message m is too long.