A Digital Signature Scheme Based On The Strong RSA Assumption And Its Application

In 2000 Cramer and Shoup [1]presented a signature scheme which is secure against adaptive chosen-message attack under the strong RSA assumption and which does not rely on the random oracle model. Cramer and Shoup added discrete-log assumption to the variation of their scheme and then produced signatures of roughly half the length. Under the strong RSA assumption only, Marc Fischlin [3] achieved the same signature size, even with a slightly improved performance than in the original strong-RSA only case or the discrete-log and strong-RSA case .But the scheme which is introduced by Marc Fischlin included X-OR operation , so that the scheme is difficult to be applied to the Verifiable Signature Sharing(VES).In this paper, we revisited Marc Fischlin's scheme and then apply it to the verifiable signature sharing.