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 agains adaptively chosen message attacks under the discrete logarithm assumption) are provided in the random oracle model.
TAN Zuowen1,2 1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, Jiangxi, China
By virtue of the fixed point indices, we discuss the existence of the multiple positive periodic solutions to singular differential equation with state-dependent delay under the conditions concerning the first eigenvalue of the relevant linear operator. The results in this paper are optimal and totally generalize many present results.
Li Zhilong (School of Informational Management, Jiangxi University of Finance and Economics, Nanchang 330013)
