摘要
A group-oriented （t, n） threshold signature scheme employs the cryptographic techniques of secret share, allows any subset of t players out of n players to sign message on behalf of the group and disallows the creation of a valid signature if fewer than t players take part in the signature protocol. In this paper, we proposed a new group-oriented （t, n） threshold signature schemes with traceable signers based on Schnorr signature. The proposed scheme is proved traceable, robust and unforgeable against the ＂static＂ adversary with the discrete logarithm assumption in the random oracle model and existence of broadcast channel. The proofs of the strongest security （existential unforgeability against adaptively chosen message attacks under the discrete logarithm assumption） are provided in the random oracle model.
A group-oriented （t, n） threshold signature scheme employs the cryptographic techniques of secret share, allows any subset of t players out of n players to sign message on behalf of the group and disallows the creation of a valid signature if fewer than t players take part in the signature protocol. In this paper, we proposed a new group-oriented （t, n） threshold signature schemes with traceable signers based on Schnorr signature. The proposed scheme is proved traceable, robust and unforgeable against the ＂static＂ adversary with the discrete logarithm assumption in the random oracle model and existence of broadcast channel. The proofs of the strongest security （existential unforgeability against adaptively chosen message attacks under the discrete logarithm assumption） are provided in the random oracle model.
基金
Supported by the National Natural Science Foundation of China (10701040)
National Key Technology Research and Development Pro-gram of China (2006BAJ05A01)
the Scientific Research Fund of Jiangxi Provincial Education Department, China (273)
