Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / Blind Signature, signatures, partially blind signatures

Date: received 8 Sep 2004

Contact author: jkjan at cs nchu edu tw

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20040909:072117 (All versions of this report)

Short URL: ia.cr/2004/230

Discussion forum: Show discussion | Start new discussion