Partially Blind Threshold Signatures Based on Discrete Logarithms
Journal
Computer Communications
Journal Volume
22
Journal Issue
1
Pages
73-86
Date Issued
1999-01
Author(s)
W. S. Juang
Abstract
In this paper, we propose a group-oriented partially blind (t, n) threshold signature scheme based on the discrete logarithm problem. By the scheme, any t out of n signers in a group can represent the group to sign partially blind threshold signatures, which can be used in anonymous digital e-cash systems or secure voting schemes. By our proposed scheme, the growth of the bank's database was successfully minimized and the issue of e-coins is controlled by several authorities. Our proposed scheme can greatly simplify the voting processes when several elections are to be held in a short period of time by embedding information about each election in a partially blind threshold signature. In our scheme, the size of a partially blind threshold signature is the same as that of an individual partially blind signature and the signature verification process is simplified by a group public key. The security of our scheme relies on the difficulty of computing discrete logarithm. © 1999 Elsevier Science B.V. All rights reserved.
SDGs
Type
journal article