Two practical verifiable multi-secret sharing schemes
两种实用的可验证多秘密共享方案

This paper proposed two verifiable multi-secret sharing schemes based on the homogeneous linear recursion technique. In the schemes, the participants chose their own secret shares which not only decreased the computational cost of the dealer but also avoid the using of security channel. Compared with the two recent similar schemes, the schemes had advantages on public values and computational cost. Security analysis shows that the schemes can resist to the attacks available.