Leakage-resilient verifiable multi-secret sharing scheme

In the existing multi-secret sharing schemes mainly depending ondealer selections, the polynomial coefficients constructs the polynomial and takes the value of polynomial function as shadows of secrets, however, the semi-honest dealer may leak information of secrets by changing the polynomial coefficients. In order to solve the problem by semi-honest dealer, the article presented a new leakage-resilient verifiable multi-secret sharing scheme The problem of leakage secret information hiddens in that the polynomial coefficients are selected and constructed by all of participants. Comparison with existing schemes which also achieve verifiable multi-secret sharing, the scheme can still work well even when the dealer leaks some secret information. It has better efficiency in terms of computation overhead. © 2016, Beijing University of Posts and Telecommunications. All right reserved.