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].
CITATION STYLE
Kim, J., Kim, K., & Lee, C. (2002). An efficient and provably secure threshold blind signature. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2288, pp. 318–327). Springer Verlag. https://doi.org/10.1007/3-540-45861-1_24
Mendeley helps you to discover research relevant for your work.