论文标题
理想的分层秘密共享计划
An ideal hierarchical secret sharing scheme
论文作者
论文摘要
用于保护秘密K的方法之一是秘密共享计划。在此计划中，秘密k被称为经销商的特殊参与者在有限的参与者P中分发，以至于只有预定义的参与者子集在与秘密股份合作后才能恢复秘密。秘密共享计划的构建受到了许多搜索者的极大关注，他们的主要目标是提高信息率。在本文中，我们提出了一种秘密共享计划的新颖结构，该结构基于通过其组织图表所示并由树代表的公司的分层概念。我们证明，提出的方案是理想的选择，可以证明信息速率等于1。为了显示拟议方案的效率，我们讨论了所有可能的攻击和证明确保安全性的证明。最后，我们为小型公司组织图表提供了一个详细的教学示例。
One of the methods used in order to protect a secret K is a secret sharing scheme. In this scheme the secret K is distributed among a finite set of participants P by a special participant called the dealer, in such a way that only predefined subsets of participants can recover the secret after collaborating with their secret shares. The construction of secret sharing schemes has received a considerable attention of many searchers whose main goal was to improve the information rate. In this paper, we propose a novel construction of a secret sharing scheme which is based on the hierarchical concept of companies illustrated through its organization chart and represented by a tree. We proof that the proposed scheme is ideal by showing that the information rate equals 1. In order to show the efficiency of the proposed scheme, we discuss all possible kinds of attacks and proof that the security in ensured. Finally, we include a detailed didactic example for a small company organization chart.
