Welcome to the resource topic for 2003/228
Verifiably Committed Signatures Provably Secure in The Standard Complexity Model
Authors: Huafei ZhuAbstract:
In this paper, we study the security notions of verifiably committed signatures by introducing privacy and cut-off time,
and then we propose the first scheme which is 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 messages, if a co-signer with
its auxiliary input is able to generate variables called the resolution of messages such that the distribution of the
variables is indistinguishable from that generated by the primary signer alone from the views of the verifier/arbitrator,
a verifiably committed signature can be constructed.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .