• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Arabian Journal for Science and Engineering. Section A, Sciences >Trustworthy Target Key Alteration Helping Counting-Based Secret Sharing Applicability
【24h】

Trustworthy Target Key Alteration Helping Counting-Based Secret Sharing Applicability

机译：可信赖的目标密钥更改，有助于基于计数的秘密共享适用性

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

摘要

Sensitive information used online has resulted in the emergence of many security systems to be protected by secret keys. Oneof these security systems is the so-called secret sharing, in which certain key portions are distributed to allow sharing accessby a specified number of participants. The sharing system requires that several users enter their shares, at the same time, torebuild the main target key (TK) to access sensitive data within the system. Normally, the number of shares is limited by thenumber of zeros within TK as of our focus on the recent counting-based secret sharing strategy. If the number of participantsis more than TK zeros, the complete system cannot work needing to reconsider regenerating TK again. In this work, weimproved the original system of counting-based secret sharing to accommodate more participants via longer trustworthy TKselection. We proposed several possible models to enlarge the number of participants for applicable share’s keys generatedfrom TK. The trustworthy security randomness of the new shares and adjusted target keys were all measured to select the bestchoice based on standard reliability randomness test. The study experimented the proposal on typical simulations applied ondifferent target keys applicable sizes. The results presented that the final target key TK created as having the highest ratio ofrandomness to be preferred choice proven secure and reliable to protect information within the system.
机译：在线使用的敏感信息导致出现了许多受秘密密钥保护的安全系统。这些安全系统之一是所谓的秘密共享，其中分配了某些关键部分以允许指定数量的参与者共享访问。共享系统要求多个用户同时输入其共享，以重建主目标密钥（TK）来访问系统内的敏感数据。通常，由于我们关注基于最近的基于计数的秘密共享策略，因此份额的数量受传统知识中的零数量限制。如果参与者的数量大于传统知识零，则整个系统将无法工作，需要重新考虑重新生成传统知识。在这项工作中，我们改进了基于计数的秘密共享的原始系统，以通过更长的可信任TK选择来容纳更多参与者。我们提出了几种可能的模型，以扩大从TK生成的适用共享密钥的参与者数量。根据标准可靠性随机性测试，对新股和调整后的目标密钥的可信赖安全性随机性进行了测量，以选择最佳选择。该研究对针对不同目标密钥适用大小的典型模拟进行了实验。结果表明，最终目标密钥TK被创建为具有最高的随机性比率，成为首选，被证明是安全可靠的，可以保护系统内的信息。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号