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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Comm. ACM 24, pp.84–88, 1981.
D. Chaum, Blind Signatures for Untraceable Payments, Advances in Cryptology-Crypto’82, pp.199–203, Springer-Verlag, 1983.
D. Chaum, A. Fiat, M. Naor, Untraceable Electronic Cash, Advances in Cryptology-Crypto’88, LNCS 403, pp.319–327, Springer-Verlag, 1988.
Y. Desmedt, Threshold Cryptosystems, Advances in Cryptology-Auscrypt’92, LNCS 718, Springer-Verlag, 1993.
P. Feldman, A Practical Scheme for Non-interactive Verifiable Secret Sharing, In Proc. 28th FOCS, pp. 427–437, 1987.
A. Fujioka, T. Okamoto and K. Ohta, A Practical Secret Voting Scheme for Large Scale Election, Advances in Cryptology-Auscrypt’92, LNCS Vol.718, pp.248–259, Springer-Verlag, 1993.
A. Fujioka, M. Abe, M. Ohkubo, and F. Hoshino, An Implementation and an Experiment of a Practical and Secure Voting Scheme, Proc. of SCIS2000, C48, Okinawa, Japan, Jan. 26–28, 2000.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Advances in Cryptology-Eurocrypt’96, LNCS Vol.1070, pp.354–371, Springer-Verlag, 1996.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Advances in Cryptology-Eurocrypt’99, LNCS Vol.1592, pp.295–310, Springer-Verlag, 1999.
S. Jarecki and A. Lysyanskaya, Adaptively Secure Threshold Cryptography, Advances in Cryptology-Eurocrypt’00, LNCS Vol.1807, pp.221–242, Springer-Verlag, 2000.
W. S. Juang and C. L. Lei, Blind Threshold Signatures Based on Discrete Logarithm, Proceedings of the 2nd Asian Computing Science Conference, Lecture Notes in Computer Science 1179, Springer-Verlag, pp. 172–181, 1996.
W. S. Juang, C. L. Lei, and Pei-Ling Yu, Provably Secure Blind Threshold Signatures Based on Discrete Logarithm, Proceedings of 1999 National Computer Symposium, pp. C198–C205, 1999.
T. Okamoto, Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes, Advances in Cryptology-Crypto’92, LNCS Vol.740, pp.31–53, Springer-Verlag, 1992.
M. Ohkubo, F. Miura, M. Abe, A. Fujioka and T. Okamoto, An Improvement on a Practical Secret Voting Scheme, Information Security’99, LNCS Vol.1729, pp.225–234, Springer-Verlag, 1999.
T.P. Pedersen, Non-interactive and Information-theoretic Secure Verifiable Secret Sharing, Advances in Cryptology-Crypto’91, LNCS Vol.576, pp.129–140, Springer-Verlag, 1992.
T.P. Pedersen, A Threshold Cryptosystem without a Trusted Party, Advances in Cryptology-Eurorypt’91, LNCS Vol.547, pp.522–526, Springer-Verlag, 1992.
D. Pointcheval and J. Stern, Provably Secure Blind Signature Scheme, Advances in Cryptology-Asiacrypt’96, LNCS Vol.1163, pp.252–265, Springer-Verlag, 1996.
D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, LNCS Vol.13, Num.3, pp.361–396, Springer-Verlag, 2000.
C. P. Schnorr, Efficient Identification and Signatures for Smart Cards, Advances in Cryptology-Crypto’89, LNCS Vol.435, pp.235–251, Springer-Verlag, 1990.
A. Shamir, How to Share a Secret, Comm. ACM Vol.22, pp.612–613, 1979.
V. Shoup, Practical Threshold Signatures, Advances in Cryptology-Eurocrypt’00, LNCS Vol.1807, pp.207–220, Springer-Verlag, 1996.
D.R. Stinson and R. Strobl, Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates, Information Security and Privacy, ACISP’01, LNCS Vol.2119, pp. 417–434, Springer-Verlag, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, J., Kim, K., Lee, C. (2002). An Efficient and Provably Secure Threshold Blind Signature. In: Kim, K. (eds) Information Security and Cryptology — ICISC 2001. ICISC 2001. Lecture Notes in Computer Science, vol 2288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45861-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-45861-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43319-4
Online ISBN: 978-3-540-45861-6
eBook Packages: Springer Book Archive