A Multisecret Sharing Authenticating Scheme

This paper proposes a multisecret sharing authenticating scheme. In the scheme, the dealer can freely give any set of multiple secrets for sharing and the sub-secret held by the participant is not only reusable but also verifiable. The proposed scheme provides efficient solutions against cheating by the dealer and cheating by any participant. The scheme′s security is based on the computing difficulty of solving the Factorization Problem and the Discrete Logarithm Problem. The proposed scheme is clearly superior to the other existing schemes.