Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Inforamtion Science and Engineering, Vol.18 No.1, pp.23-39 (January 2002)

Provably Secure Blind Threshold Signatures Based on
Discrete Logarithm

Chin-Laung Lei, Wen-Shenq Juang* and Pei-Ling Yu
Department of Electrical Engineering
National Taiwan University
Taipei, 106 Taiwan
*Department of Information Management
Shih Hsin University
Taipei, 116 Taiwan

In this paper, we propose a provably secure group-oriented blind (t, n) threshold signature scheme, which is the first scheme whose security is proved to be equivalent to the discrete logarithm problem in the random oracle model. Based on the scheme, any t out of n signers in a group can represent the group in signing blind threshold signatures, which can be used in anonymous digital e-cash systems or secure voting systems. By means of our proposed scheme, the issue of e-coins is controlled by several authorities. In our scheme, the size of a blind threshold signature is the same as that of an individual blind signature, and the signature verification process is equivalent to that for an individual signature.

Keywords: provably secure blind signatures, threshold signatures, discrete logarithm, secure e-cash systems, secure voting systems

Full Text () Retrieve PDF document (200201_03.pdf)

Received February 9, 2000; revised June 27 & September 7, 2000; accepted October 26, 2000.
Communicated by Hsu-Chun Yen.