An efficient (t, n) multi-secret sharing scheme with verification

Secret sharing plays an important role in the information security. The number of the secrets that can be in each session provides a performance measure of the secret sharing. Recently, a new type of (t, n) multi-secret sharing scheme is proposed, in which multiple secrets instead of only one secret can be shared in each sharing session. This type of schemes has found important applications such as sharing a large secret. However, most of the existing schemes have no property of verification. Although there are a few verifiable schemes, they need a secure channel established in advance, which is impractical for applications more or less. Motivated by these concerns, a new verifiable (t, n) multi-secret sharing scheme is proposed. Besides merits of the existing schemes, the new scheme can check whether each participant or the dealer is a cheater or not, and it needs no secure channel. Analyses show that the proposed scheme is a secure and efficient scheme.