Dynamic general secret sharing based on bilinear pairing

Abstract

An efficient multi-secret sharing scheme with a generalized access structure based on bilinear pairing was proposed. Each participant's private key was used as his secret share. No security channel existed between the dealer and the participants. The shadows of the participants did not need to reselect when the system accepted a new participant or fired an old participant, which was easier to implement. The analysis shows that this scheme is correct, can prevent the participant's cheating attacks, and the sub-secrets of participants can be shared.