Hierarchical Scheme for Secret Separation Based on Computable Access Labels

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.