A Verifiable Multi-secret Sharing Scheme Based on General Access Structure

Most secret sharing schemes have the problem that other participants' shadow must be recalculated if an old participant is deleted or a new participant is added.An efficient multi-secret sharing scheme has been proposed based on general access structure.In the proposed scheme,the dealer can add a new participant or delete an old participant without changing other participants' shadow.Moreover,the scheme not only can detect the cheating of the dealer or any participant efficiently,but also the participants can reconstruct a secret with parallel procedure in a secret recovery phase