A Novel Non-interactive Verifiable Secret Sharing Scheme

In this paper, we present a novel non-interactive verifiable secret sharing scheme constructed by Shamir's secret sharing scheme for secure multi-party communication protocol in distributed networks. In our scheme, only the Dealer is allowed to send message and there is no communication among players. The Dealer only publishes one commitment for verification, and the number of the commitment will not increase along with the augment of the threshold of secret sharing scheme. At the same time, the efficiency of verification for each share doesn't fall as the augment of the threshold. The security of the verifiable secret sharing scheme is based on the intractability of computing discrete logarithm.