A practical publicly verifiable secret sharing scheme based on bilinear pairing

Abstract

A practical publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of B. Schoenmakerspsila PVSS and its secret is not the form of discrete logarithm, thus this PVSS is extremely practical. Moreover, in the schemepsilas distribution of shares phase, only using bilinearity of bilinear pairing, anybody can verify whether the participants received correct shares without implementing zero-knowledge proofs, without implementing the non-interactive protocol and without construction so called witness of shares applying Fiat-Shamirpsilas technique. Subsequently, in the schemepsilas reconstruction of secret phase, the released shares may be verified by anybody with the same method. Since the PVSS need not to implement non-interactive protocol to prevent malicious players. Therefore this scheme is simpler, more efficient and practical suitable for some especially case.