首页> 外文期刊>IEEE/ACM Transactions on Networking >Resource-aware conference key establishment for heterogeneous networks
【24h】

Resource-aware conference key establishment for heterogeneous networks

机译:异构网络的资源感知会议密钥建立

获取原文
获取原文并翻译 | 示例

摘要

The Diffie-Hellman problem is often the basis for establishing conference keys. In heterogeneous networks, many conferences have participants of varying resources, yet most conference keying schemes do not address this concern and place the same burden upon less powerful clients as more powerful ones. The establishment of conference keys should minimize the burden placed on resource-limited users while ensuring that the entire group can establish the key. In this paper, we present a hierarchical conference keying scheme that forms subgroup keys for successively larger subgroups en route to establishing the group key. A tree, called the conference tree, governs the order in which subgroup keys are formed. Key establishment schemes that consider users with varying costs or budgets are built by appropriately designing the conference tree. We then examine the scenario where users have both varying costs and budget constraints. A greedy algorithm is presented that achieves near-optimal performance, and requires significantly less computational effort than finding the optimal solution. We provide a comparison of the total cost of tree-based conference keying schemes against several existing schemes, and introduce a new performance criterion, the probability of establishing the session key (PESKY), to study the likelihood that a conference key can be established in the presence of budget constraints. Simulations show that the likelihood of forming a group key using a tree-based conference keying scheme is higher than the GDH schemes of Steiner et al.. Finally, we study the effect that greedy users have upon the Huffman-based conference keying scheme, and present a method to mitigate the detrimental effects of the greedy users upon the total cost.
机译:Diffie-Hellman问题通常是建立会议密钥的基础。在异构网络中,许多会议的参与者使用的资源各不相同,但是大多数会议键控方案都无法解决此问题,并且给功能较弱的客户带来了与功能更强大的客户相同的负担。会议密钥的建立应最大程度地减少资源有限的用户的负担,同时确保整个小组都可以建立密钥。在本文中,我们提出了一种分层的会议键控方案,该方案形成了用于依次建立组键的较大子组的子组键。一棵称为会议树的树控制着子组密钥形成的顺序。通过适当设计会议树,可以建立考虑成本或预算各异的用户的关键建立方案。然后,我们检查用户具有不同成本和预算约束的情况。提出了一种贪婪算法,该算法可实现接近最佳的性能,并且与寻找最佳解决方案相比,所需的计算工作量要少得多。我们将基于树的会议密钥方案的总成本与几种现有方案进行了比较,并引入了一种新的性能标准,即建立会议密钥的可能性(PESKY),以研究可以在其中建立会议密钥的可能性。存在预算限制。仿真表明,使用基于树的会议密钥方案形成组密钥的可能性高于Steiner等人的GDH方案。最后,我们研究了贪婪的用户对基于Huffman的会议密钥方案的影响,以及提出了一种减轻贪婪的用户对总成本的不利影响的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号