Abstract
The idea behind a (t, n) threshold blind signature is that a user can ask at least t out of n players of a group to cooperate to generate a signature for a message without revealing its content. This paper first presents a new blind signature scheme from Weil pairing on elliptic curves. Based on this scheme, a threshold blind signature scheme is proposed. It is efficient and has the security properties of robustness and unforgeability. In the proposed scheme, the group manger is introduced to take the role of distributing the group secret key to each player. However, he cannot forge the players to generate partial blind signatures (Each partial blind signature depends on not only the secret key of the player, but also a random number the player picks). Compared with a threshold signature with a trusted third party, its advantage is obvious; Compared with a threshold signature without a trusted third party, it is more simple and efficient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Gennaro, S. Jarecki, et al., Robust threshold DDS signatures, Advances in Cryptology, EUROCR YPT’ 96, LNCS 1070, New York, Springer-Verlag, 1996, 354–371.
C. Li, T. Hwang, N. Lee, Remark on the threshold RSA signature scheme, Advances in Cryptology, CRYPTO’93, LNCS 773, New York, Springer-Verlag, 1994, 413–420.
Boldyreva, Threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme, Public Key Cryptography, PKC 2003, LNCS 2567, New York, Springer-Verlag, 2003, 31–46.
D. Pointcheval, J. Stern, Provably secure blind signature schemes, Advances in Cryptology, ASIACRYPT’96, LNCS 1163, New York, Springer-Verlag, 1996, 252–265.
D. chaum, Blind signature for untraceable payments, Advances in Cryptology, CRYPTO’82, New York, Springer-Verlag, 1983, 199–203.
M. Bellare, C. Namprempre, et al., The one-more-RSA-inversion problems and the security of Chaum’s blind signature scheme, http://eprint.iacr.org/2001/002.pdf.
C. L. Lei, W. S. Juang, P. L. Yu, Provably secure blind threshold signatures based on discrete logarithm, Journal of Information Science and Engineering, 18(2002)1, 23–39.
Kim, K. Kim, C. Lee, An efficient and provably secure threshold blind signature, ICIS’2001, LNCS 2288, New York, Springer-Verlag, 2002, 318–327.
D. L. Vo, F. Zhang, K. Kim, A new threshold blind signature scheme form pairings, The 2003 Symposium on Cryptography and Information Security, Japan, 2003, 124–129.
D. Boneh, M. Franklin, ID-based encryption from the Weil-pairing, Advances in Cryptology-CRYPTO’2001, LNCS 2139, New York, Springer-Verlag, 2001, 213–229.
D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil-pairing, Advances in Cryptology, ASIACRYPT’2001, LNCS 2248, New York, Springer-Verlag, 2001, 514–532.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National 973 Project of China (No.G1999035803), the National Natural Science Foundation of China (No.60373104) and the National 863 Project of China (No.2002AA143021).
About this article
Cite this article
Cheng, X., Xu, W. & Wang, X. A threshold blind signature from well pairing on elliptic curves. J. of Electron.(China) 23, 76–80 (2006). https://doi.org/10.1007/s11767-004-0071-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11767-004-0071-9