International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Provable Secure Scheme for Partially Blind Signatures

Authors:
Fuw-Yi Yang
Jinn-Ke Jan
Download:
URL: http://eprint.iacr.org/2004/230
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12200,
  title={A Provable Secure Scheme for Partially Blind Signatures},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / Blind Signature, signatures, partially blind signatures},
  url={http://eprint.iacr.org/2004/230},
  note={ jkjan@cs.nchu.edu.tw 12670 received 8 Sep 2004},
  author={Fuw-Yi Yang and Jinn-Ke Jan},
  year=2004
}