首页> 外文学位 >Adapting group key management protocols to wireless, ad-hoc networks without the assumption of view synchrony.
【24h】

Adapting group key management protocols to wireless, ad-hoc networks without the assumption of view synchrony.

机译:在不考虑视图同步的情况下,将组密钥管理协议调整为适用于无线,自组织网络。

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

摘要

Secure communication is fundamental in the current field of group key management protocols, but this must be weighed against protocol functionality on networks. As group key management enters the wireless, ad-hoc realm, the need for security in exchanges of information must also be coupled and balanced with efficiency and functionality. Dynamic and instant communications, where no previous cryptographic keys have been shared, have previously been designed and tested on wired, fully connected networks. Simply placing these protocols into a wireless, ad-hoc network leads to total failure or grave cost overruns, due to the multihop communication and random distributions of these network topologies. View Synchrony is a collection of assumptions that were useful for wired networks, but can no longer be maintained for wireless ad-hoc scenarios. These communication issues can lead to costly, ineffective, and insecure communications, when not properly considered and addressed. As the current nature of much of group key management is theoretical, practical considerations, like View Synchrony, were left unaddressed. Previous research at the University of Idaho, including my master's thesis, "A Network Simulator for Group Key Management Algorithms," [1] has led to the creation of protocols that take into account communication and computation costs, going beyond the theoretical and bringing to the forefront a viable group key management protocol that can now be extended into wireless, ad-hoc networks.;This dissertation assesses the various practical difficulties of joining, leaving, and dynamically redefining groups within wireless, ad-hoc group key management communication, in order to enable communication in new networks and topologies. Through a new disruptive tolerant efficient group key protocol, called DTEGK, large and dynamic groups can now communicate securely across an ad-hoc wireless network. Using Java simulations, this protocol implements network discovery and neighbor pairing when compared to previous network agnostic protocols. The discovery of how well various protocols, including DTEGK, address these issues are examined, and led to the determination that DTEGK offers communication over wireless ad-hoc networks without the assumptions or limitations, like View Synchrony, of previous generation protocols.
机译:安全通信是当前组密钥管理协议领域的基础,但是必须权衡网络上的协议功能。随着组密钥管理进入无线临时领域,信息交换中对安全性的需求也必须与效率和功能结合在一起并达到平衡。以前没有在共享的有线加密网络上设计和测试过动态和即时通信,而以前没有共享加密密钥。由于这些网络拓扑结构的多跳通信和随机分布,将这些协议简单地放入无线自组织网络会导致总体故障或严重的成本超支。 View Synchrony是一系列假设的集合,这些假设对于有线网络很有用,但对于无线即席场景而言不再可用。如果没有适当考虑和解决,这些通信问题可能导致昂贵,无效和不安全的通信。由于许多组密钥管理的当前性质是理论上的,因此未解决诸如“视图同步”之类的实际考虑。爱达荷州大学先前的研究,包括我的硕士论文“用于组密钥管理算法的网络模拟器”,[1]导致创建了考虑通信和计算成本的协议,这超出了理论上的范围,并带来了最前沿的是一种可行的组密钥管理协议,该协议现在可以扩展到无线ad-hoc网络中。本论文评估了在无线ad-hoc组密钥管理通信中加入,离开和动态重新定义组的各种实际困难。为了能够在新的网络和拓扑中进行通信。通过称为DTEGK的新型容错高效组密钥协议,大型动态组现在可以跨临时无线网络安全地通信。与以前的网络不可知协议相比,该协议使用Java仿真可以实现网络发现和邻居配对。对各种协议(包括DTEGK)如何很好地解决这些问题的发现进行了研究,并导致确定DTEGK通过无线自组织网络提供通信,而没有假设或限制,例如上一代协议的“视图同步”。

著录项

  • 作者

    Manz, David.;

  • 作者单位

    University of Idaho.;

  • 授予单位 University of Idaho.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 147 p.
  • 总页数 147
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号