Abstract
A multi-stage secret sharing scheme with general access structures is proposed on the difficulty of the discrete logarithm problem over finite field. In this scheme, new secrets can be added. The participant set and the access structure can be changed dynamically without updating any participant's secret shadow. In addition, the computational complexity of the proposed scheme is very low because the degree of Lagrange interpolation polynomial used is only one. The proposed scheme has advantages over the existing schemes and is more practical.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
