...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >Combinatorial repairability for threshold schemes
【24h】

Combinatorial repairability for threshold schemes

机译：阈值方案的组合可修复性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we consider methods whereby a subset of players in a (k, n)-threshold scheme can "repair" another player's share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme. The repairing protocol should not compromise the (unconditional) security of the threshold scheme, and it should be efficient, where efficiency is measured in terms of the amount of information exchanged during the repairing process. We study two approaches to repairing. The first method is based on the "enrollment protocol" from Nojoumian et al. (IET Inf Secur 4: 202-211, 2010) which was originally developed to add a new player to a threshold scheme (without the participation of the dealer) after the scheme was set up. The second method distributes "multiple shares" to each player, as defined by a suitable combinatorial design. This method results in larger shares, but lower communication complexity, as compared to the first method.
机译：在本文中，我们考虑了一种方法，当（k，n）阈值方案中的参与者的子集丢失或损坏时，可以“修复”其他参与者的份额。这将在没有设立该计划的经销商参与的情况下进行。修复协议不应损害阈值方案的（无条件）安全性，并且应该是有效的，其中，根据修复过程中交换的信息量来衡量效率。我们研究了两种修复方法。第一种方法基于Nojoumian等人的“注册协议”。 （IET Inf Secur 4：202-211，2010），最初是为了在门槛计划建立之后向门槛计划添加新的参与者（无交易员参与）。第二种方法是按照适当的组合设计定义，将“多个份额”分配给每个玩家。与第一种方法相比，此方法导致份额更大，但通信复杂度更低。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号