On Novel Verifiable Multi-Secret Sharing Scheme

In this paper, we analyze two improved YCH schemes and one multi-secret sharing scheme that is based on homogeneous linear recursion, and further based on Shamir secret sharing we propose a verifiable multi-secret sharing model, whose time complexity of secret reconstruction is O(k x t(2)) and is superior to the other two improved YCH models (O(t(3))(t > k)O(k(3))(t <= k), O(k x (n + k)(2))), and that the secret reconstruction time in simulations is even less than the other three models. We compare the advantages and disadvantages of the four models in the time complexity, the verifiability, the security, and the other aspects. When n > k, the required number of open values of the new model are fewer than the numbers of the other three models. The simulations show that the new model behaves better than the other three models in saving time to distribute and reconstruct secrets.