A Distributed Multi-secret Sharing Scheme on the (t,n) Threshold

In the most present threshold multi-secret sharing scheme, there were some problems. For example, each participant's shadow was generated by the dealer, the fixed threshold, need of the secure channels, the fixed dealer or the secret center. To overcome these problems, a distributed multi-secret sharing scheme on the (t, n) threshold was proposed in this paper. This scheme has the following properties: 1) Each participant selects his shadow by himself; 2) There is no secure channel 3) There is no the fixed dealer, each participant may be dealer to distribute the multi-secret, and the multi-secret could be accomplished one time such as to distribute and to comeback and to update and to validate and so on operations;4) The participant could be dynamically added or deleted; 5) The efficient solutions against multiform cheating of any participant are proposed, therefore the proposed scheme has practicability and highly security.