05553816

a

05553816 Zhu, Huafei Constructing committed signatures from strong-RSA assumption in the standard complexity model. Bao, Feng (ed.) et al., Public key cryptography -- PKC 2004. 7th international workshop on theory and practice in public key cryptography, Singapore, March 1--4, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21018-0/pbk). Lecture Notes in Computer Science 2947, 101-114 (2004). 2004 Berlin: Springer EN committed signatures fair exchange protocols strong RSA assumption

doi:10.1007/b95631

Summary: In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA 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.