Verifiable threshold multi-secret sharing scheme based on discrete logarithm problem.

The traditional secret sharing scheme cannot verify the fraud of participants or secret distributors. The secret sharing scheme proposed by Lin-Wu et al. can verify these frauds, which requires a lot of computation. The secret shares in this scheme must be calculated which can not meet the randomness of shares. It needs to establish secure channels between the secret distributor and each participant, which increases the burden of the implementation of the scheme. Therefore, an improved secret sharing scheme was proposed in the paper. Participants do not need to verify fraud by the secret distributor, which reduces the calculation of participants. The secret shares are chosed by the participants, which achieves the randomness of secret shares. In addition, the scheme can share mutli-secret sharing and update the group secrets. It also can dynamically add new participants. [ABSTRACT FROM AUTHOR]