Novel Verifiable General Secret Sharing Using Weil Pairing

Secret sharing is an important information security issue in many applications. We propose a novel general secret sharing scheme based on the modified Weil pairing function and two hard assumptions (computational Weil Diffie-Hellman assumption and elliptic curve discrete logarithmic assumption). The new scheme can present from adversaries´ attacks. Since the secret shadows are chosen by the participants themselves, they could use their own shadows repeatedly and there will be no need for any secret communications existing between the dealer and participants. Performance analysis shows that our scheme has low computational cost.