Abstract
Secret sharing scheme creates an effective method to safeguard a secret by dividing it among several participants. By using cryptographic hash functions and the herding hashes technique, Chum and Zhang proposed a simple and efficient secret sharing scheme. In this article, we implement such scheme by several examples, namely, a general (t, n) threshold scheme, a one-weighted (t, n) threshold scheme, a multisecret scheme, a verifiable (t, n) threshold scheme, and a proactive scheme. We conduct a performance comparison study and find that the hash-based threshold scheme setup is two times, and secret recovery is six times faster than Shamir threshold scheme.
Sign-in/Register to access full text options 
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
