Verifiable Multi-Secret Sharing Scheme Based on RSA & DLP

Most previous secret sharing schemes have some problems in that those schemes can not deter the cheating of the dealer and secret shadowholders simultaneously, and the computation of a secret recovery is overhead. Based on the difficulty of computing the Discrete Logarithm Problem(DLP) and the RSA factorization problem of a large integer, a more efficient solving scheme has been proposed. This new scheme provides efficient solutions against cheating of the dealer and cheating of any participant. Compared with the other existing schemes, the proposed scheme has the advantages of lower computation and the parallel reconstruction in a secret recovery phase.