A General Multi-Secret Sharing Scheme for Cheat-Proof

The most present threshold multi-secret sharing schemes cannot efficiently solve the problem that a participant is dynamic added or deleted. In this study, an efficient multi-secret sharing scheme is designed with general access structure based on the intractability of reversing the one-way Hash function and solving the discrete logarithm problem. The proposed scheme has the following properties:cheating of the dealer or any participant can be detected efficiently; two public parameters of a new secret would be published by the dealer; the participants reconstruct a secret with parallel procedure in a secret recovery phase; and the shadows of other participants would not change when the system accepts a new participant or fires an old participant.