Verifiable Multi-secret Sharing Scheme Based on Homogeneous Linear Recursion
Xin Li · Beijing Daxue Xuebao. Zirankexueban · 2010
A new multi-secret sharing scheme based on homogeneous linear recursion is proposed,and then it is converted into a verifiable scheme.In the distribution phase,very few of public values are needed to publish.In the recovery phase,each participant only needs to submit a pseudo shadow instead of his secret shadow,and his secret shadow cannot be disclosed.When secrets are changed,secret shadows don't need to be redistributed,which makes secret shadow able to be used multiple times.The proposed scheme has many advantages,for example,the secret shares can be used multiple times and the scheme publishes very few parameters as well as the reconstructed polynomial has a low degree.This makes the proposed scheme more efficient.Therefore,it better satisfies demands of various applications.