Abstract
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an efficient verifiable secret sharing scheme based on Shamir's (t, n) secret sharing scheme. Our proposed scheme can protect the secret and all shares unconditionally in the verification process. Our proposed solution can be used as an important cryptographic tool to design protocols for other related problems of secret sharing.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
