Abstract

Based on Shamir's threshold secret sharing scheme,the security of the linear one-way function and the difficulty of the discrete logarithm problem,a verifiable multi-secret sharing scheme was proposed.In this scheme,each participant needed just one secret share to share a set of secrets.Before recovering the secrets,participants could verify the correctness of the shadow shares provided by other participants.After recovering all of the secrets,the secret shares of the participants were still kept confidential and the secret shares could be used to share a new set of secrets.At the same time,the proposed scheme had fewer public parameters,and it did not require secure communication channels.

Full Text
Published version (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