Repairable Threshold Secret Sharing Schemes
Repairable Threshold Secret Sharing Schemes
复制标题
可修复阈值秘密共享方案
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Fang
中科院分区：
文献类型：
--
作者：
Xuan Guang;Jiyong Lu;Fang
在本文中，我们提出了一类无需经销商帮助即可具有股票间修复功能的门限秘密共享方案，我们将其称为可修复门限秘密共享方案。具体来说，如果一个共享出现故障，例如损坏或丢失，它将仅由其他一些共享修复。这种可修复阈值秘密共享方案的构造是通过在分布式存储系统中应用线性化多项式和重新生成代码来设计的。此外，还引入了新的修复率来表征修复功能的性能和效率。然后得出修复率可实现的上限，这意味着修复的最优性并描述了不同共享之间的安全性。在这种修复的最优性下，我们进一步讨论了传统的信息率并指出了其最优性，可以描述秘密共享方案在存储方面的效率。最后，通过应用最小带宽再生（MBR）码，我们的结构设计了可修复阈值秘密共享方案，同时实现了最佳修复和信息速率。
In this paper, we propose a class of threshold secret sharing schemes with repairing function between shares without the help of the dealer, that we called repairable threshold secret sharing schemes. Specifically, if a share fails, such as broken or lost, it will be repaired just by some other shares. A construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storage systems. In addition, a new repairing rate is introduced to characterize the performance and efficiency of the repairing function. Then an achievable upper bound on the repairing rate is derived, which implies the optimality of the repair and describes the security between different shares. Under this optimality of the repair, we further discuss traditional information rate and also indicate its optimality, that can describe the efficiency of secret sharing schemes in the aspect of storage. Finally, by applying the minimum bandwidth regenerating (MBR) codes, our construction designs repairable threshold secret sharing schemes achieving both optimal repairing and information rates simultaneously.