• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >Establishing the broadcast efficiency of the Subset Difference Revocation Scheme
【24h】

Establishing the broadcast efficiency of the Subset Difference Revocation Scheme

机译：建立子集差异撤销方案的广播效率

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

摘要

When an organisation chooses a system to make regular broadcasts to a changing user base, there is an inevitable trade off between the number of keys a user must store and the number of keys used in the broadcast. The Complete Subtree and Subset Difference Revocation Schemes were proposed as efficient solutions to this problem. However, all measurements of the broadcast size have been in terms of upper bounds on the worst-case. Also, the bound on the latter scheme is only relevant for small numbers of revoked users, despite the fact that both schemes allow any number of such users. Since the broadcast size can be critical for limited memory devices, we aid comparative analysis of these important techniques by establishing the worst-case broadcast size for both revocation schemes.
机译：当组织选择一个系统向不断变化的用户群进行常规广播时，用户必须存储的密钥数量与广播中使用的密钥数量之间不可避免地要取舍。提出了完整的子树和子集差异吊销方案作为此问题的有效解决方案。但是，所有广播大小的度量都是在最坏情况下的上限。同样，尽管两种方案都允许任意数量的此类用户，但后一种方案的范围仅与少数被撤销的用户有关。由于广播大小对于有限的存储设备可能至关重要，因此我们通过为两种吊销方案建立最坏情况的广播大小，来帮助对这些重要技术进行比较分析。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号