New blind signature schemes based on the (elliptic curve) discrete logarithm problem

Abstract

Blind signature is a kind of digital signature with significant applications in anonymous electronic voting and electronic payment. In this paper, first, we analyze a recently introduced blind signature scheme and show that, without obtaining the signing key, the attacker can forge a valid signature for any arbitrary message. In other words, Dameri et al.'s blind signature scheme is universally forgeable. Then, we propose a new blind signature scheme based on the discrete logarithm problem. Finally, we introduce an elliptic curve-based variant of the proposed scheme which has lower computational overhead.