Abstract
In this paper, we propose a threshold scheme for sharing a secret between tree-like graph nodes. Nodes whose descendants cover the entire set of leaf nodes can recover the secret. Otherwise, the nodes do not receive any information about the secret. The scheme is based on the construction of a polynomial with the coefficients determined by the graph structure.
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 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.
