Constructing committed signatures from strong-RSA assumption in the standard complexity model

Abstract

In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong USA assumption. The idea behind the construction is that given any valid partial signature of message m, if a co-signer with its auxiliary input is able to generate variables called the resolution of message m such that the distribution of the variables is indistinguishable from those generated by the primary signer alone from the point views of the verifier/arbitrator, then from which a committed signature can be derived. © International Association for Cryptologic Research 2004.