A Provable Secure Scheme for Partially Blind Signatures

Fuw-Yi Yang; Jinn-Ke Jan

Paper 2004/230

A Provable Secure Scheme for Partially Blind Signatures

Fuw-Yi Yang and Jinn-Ke Jan

Abstract

This paper proposes a new scheme for partially blind signature based on the difficulty in solving the discrete logarithm problem. Under the assumption of the generic model, random oracle model, and intractable ROS-problem, this paper formally proves that the proposed scheme is secure against one-more signature forgery under the adaptively parallel attack. Previous schemes using two signing equations for plain information and commitment. The proposed scheme uses two secret keys to combine these two signing equations, thus it is more efficient than previous schemes in both communicational and computational cost.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Blind Signature signatures partially blind signatures
Contact author(s): jkjan @ cs nchu edu tw
History: 2004-09-09: received
Short URL: https://ia.cr/2004/230
License: CC BY

BibTeX

@misc{cryptoeprint:2004/230,
      author = {Fuw-Yi Yang and Jinn-Ke Jan},
      title = {A Provable Secure Scheme for Partially Blind Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2004/230},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/230}},
      url = {https://eprint.iacr.org/2004/230}
}