A dynamic (t, n) threshold signature scheme with provable security

We represent a novel threshold signature scheme based on the difficulty of discrete logarithm problem. For the maintenance, the group members can be dynamically added and deleted. In the security, the individual signature and the threshold signature can not be forged, the dishonest signers can be distinguished, and the valid signature can not be deniable. In the efficiency, because 160bits are used in the signature and all the individual signatures are sent to SC instead of being sent to other members, the cost of communication and computation is decreased. Analysis shows that this scheme is effective and secure.