A verifiable threshold multi-secret sharing scheme

Based on the intractability of the factorization problem and the discrete logarithm problem,a verifiable(t,n)-threshold multi-secret sharing scheme is presented to overcome the drampack of Lin-Wu scheme that is easy to be attacked by any malicious participant.The proposed scheme provides an efficient solution to the cheating problems between the dealer and each participant.In this scheme,the dealer can share any new secret among these participants dynamically,and only one reusable secret shadow is required to be kept by each participant for sharing multiple secrets.Compared with the existing schemes,the proposed scheme reduces the number of modular exponentiation operations in preventing the dealer or each participant from cheating,and only 3 public values are required for sharing a secret,which makes the proposed scheme more attractive in computation and communication than the existing ones.Analyses show that this scheme is a secure and efficient secret sharing scheme.