[Resource Topic] 2004/230: A Provable Secure Scheme for Partially Blind Signatures

Welcome to the resource topic for 2004/230

A Provable Secure Scheme for Partially Blind Signatures

Authors: Fuw-Yi Yang, Jinn-Ke Jan


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.

ePrint: https://eprint.iacr.org/2004/230

See all topics related to this paper.

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 .