International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Verifiably Committed Signatures Provably Secure in The Standard Complexity Model

Authors:
Huafei Zhu
Download:
URL: http://eprint.iacr.org/2003/228
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2003-11941,
  title={Verifiably Committed Signatures Provably Secure in The Standard Complexity Model},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2003/228},
  note={New report zhuhf@zju.edu.cn 12357 received 1 Nov 2003},
  author={Huafei Zhu},
  year=2003
}