An Efficient and Provably Secure Threshold Blind Signature

Abstract

We propose an efficient and provably secure threshold blind signature scheme based on Okamoto-Schnorr blind signature. In our scheme, any t(t < n) out of n signers can generate a blind signature and any one can verify the signature using the same verification process used in Okamoto-Schnorr blind signature. New scheme can be used for blind signature-based voting systems with multiple administrators and secure electronic cash systems to prevent their abuse. We prove that our scheme is to be as secure as Okamoto-Schnorr’s blind signature scheme and more efficient than Juang et al.’s scheme [12].