An Efficient V-Fairness (t, n) Threshold Secret Sharing Scheme

Lee and Laih proposed a v-fairness (t, n) secret sharing scheme such that the participants can recover a secret without providing their shadows simultaneously. Besides, the honest participants can obtain the secret even if there are v cheaters among the t participants in their scheme, where v<;t/2. However, in Lee and Laih's scheme, each participant must keep three shadows to reconstruct only one secret. In this paper, we propose an efficient v-fairness (t, n) multi-secret sharing scheme, which reduces the number of secret shadows kept by each member and increases the messages that can be concealed in the system. Consequently, our scheme allows each member just keeps two shadows. Besides, we only take a slight computation cost to accomplish the purpose of sharing multiple secrets. Thus, our scheme is more efficient and generic than the previous related papers.