A NOTE ON A THRESHOLD VERIFIABLE MULTI-SECRET SHARING SCHEME

摘要

In a verifiable multi-secret sharing (VMSS) scheme, multiple secrets can be shared by one sharing process. In 2008, Massoud and Mashhadi proposed a threshold VMSS scheme. They claimed that the scheme had efficient verifiable property that was better than the scheme proposed by Shao and Cao. In this paper, we analyse their scheme and point out that it cannot identify whether the dealer and the participants are honest or not. We further improve their scheme to make it satisfy verifiable property. It notes that the verifiable property in our improved scheme is information-theoretic secure which is more secure than the computationally secure verifiable property of previous schemes.