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.

中文翻译：

---

基于可计算访问标签的秘密分离的分层方案

摘要

在本文中，我们提出了一种在树状图节点之间共享秘密的阈值方案。其后代覆盖整个叶节点集的节点可以恢复秘密。否则，节点将不会收到有关机密的任何信息。该方案基于具有由图结构确定的系数的多项式的构造。