共查询到17条相似文献,搜索用时 187 毫秒
1.
2.
移动自组网的组密钥链更新算法 总被引:1,自引:0,他引:1
针对移动自组网拓扑结构变化频繁,组密钥更新频率高,计算次数多,通信量巨大的特点,提出了一种新的组密钥管理算法-分布式组密钥链更新算法(DKCGR).基于密钥链和左/右向性密钥结构设计了DKCGR算法.通过相邻节点生成共享密钥建立一条循环的密钥链和向左或者向右方向生成若干共享密钥,完成组密钥的更新.同时,借鉴LKH的树形密钥方案,将密钥链用4叉树表示.实验结果表明:DKCGR算法随着加入节点的增多其计算次数将是一个常数,有效控制计算量.与传统的LKH相比节约了n/2(n指节点数)次通信量. 相似文献
3.
4.
针对无线传感器网络能量、计算能力、存储空间以及带宽等局限性问题,提出了一种适合无线传感器网络的密钥协商方案EKASFWSN(Efficient Key Agreement Scheme for Wireless Sensor Networks).该方案首先运用身份加密(IBE)算法预置网络系统参数并通过计算获得节点的相关参数;然后节点使用组播技术向邻居节点广播其ID号并利用Diffie-Hellman密钥交换技术和IBE算法安全地交换节点间的相关参数、计算节点的密钥;最后利用计算获得的节点间共享密钥使用对称密码方法对网络消息进行加、解密.与目前在WSNS研究中比较流行的传统网络密钥协商方案进行的理论分析和仿真实验,结果表明:EKASFWSN方案较好的解决了无线传感器网络在计算能力、能量、存储空间和带宽等方面的局限性问题;并通过密钥交换和身份加密等技术提高了节点通信的安全. 相似文献
5.
一种轻量级的无线传感器网络密钥建立协议 总被引:1,自引:0,他引:1
该文提出了一种适用于无线传感器网络的轻量级密钥建立协议。该协议以预置的瞬时初始密钥为基础,通过优化密钥建立过程中的信息交互,能够获得更好的可扩展性和更低的能量开销。对该协议的完成时间和网络的连通概率的理论分析表明,该协议是可行的。从仿真结果可以看出,该协议在典型的网络规模下可以获得超过97%的连通概率。与同类协议相比,可以在保证足够的连通概率的情况下以更短的时间完成密钥建立。当网络密度为单跳30个节点时,建立时间小于5.2 s。此外,该协议的能量开销只有同类协议的25%,因此更适合应用于资源受限的无线传感器节点。 相似文献
6.
7.
防御无线传感器网络Sybil攻击的新方法 总被引:7,自引:1,他引:6
在传感器网络中,Sybil 攻击是一类主要的攻击手段.通过随机秘密信息预分配,利用节点身份证人确认机制,提出了防御传感器网络Sybil 攻击的新方案并进行了综合性能分析.在新方案中,基于单向累加器建立了传感器网络节点秘密信息管理和分配方案,在共享密钥建立阶段,提出了传感器网络认证对称密钥建立协议,并在universally composable(UC)安全模型中对该协议进行了可证明安全分析,该协议可建立网络邻居节点之间惟一的对称密钥. 相似文献
8.
9.
10.
随机密钥预分配是无线Ad hoc网络中最有效的密钥管理机制。提出了一个适用于Ad hoc网络的基于哈希函数的对偶密钥预分配方案。方案利用哈希函数的单向性,由哈希链形成密钥池,节点仅需预分发数量较少的密钥,就能与邻近节点有效建立对偶密钥。方案具有较低的存储成本与计算开销,同时能达到完全连通性,并能动态管理节点与密钥。分析表明,方案具有较好的有效性和安全性,更适合Ad hoc网络。 相似文献
11.
12.
Modeling Pairwise Key Establishment for Random Key Predistribution in Large-Scale Sensor Networks 总被引:1,自引:0,他引:1
Dijiang Huang Mehta M. van de Liefvoort A. Medhi D. 《Networking, IEEE/ACM Transactions on》2007,15(5):1204-1215
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys are required to be established between them. Considering the storage limitations and the lack of post-deployment configuration information of sensors, random key predistribution schemes have been proposed. Due to limited number of keys, sensors can only share keys with a subset of the neighboring sensors. Sensors then use these neighbors to establish pairwise keys with the remaining neighbors. In order to study the communication overhead incurred due to pairwise key establishment, we derive probability models to design and analyze pairwise key establishment schemes for large-scale sensor networks. Our model applies the binomial distribution and a modified binomial distribution and analyzes the key path length in a hop-by-hop fashion. We also validate our models through a systematic validation procedure. We then show the robustness of our results and illustrate how our models can be used for addressing sensor network design problems. 相似文献
13.
Research on wireless sensor networks (WSNs) has been receiving a lot of attention recently. Because of the constraints on the cost of hardware, there are a lot of restrictions regarding memory, computational ability, and energy consumption, hampering WSN research. So far, many key establishment schemes have been proposed for WSNs. For the proposed schemes, random key predistribution is a practical solution. With this, each sensor shares a common key with its neighbors via predistributed keys. However, it may happen that two sensor nodes do not share a common key. In this paper, an efficient grid-based pairwise key predistribution scheme for WSNs is proposed. In the proposed scheme, multiple polynomials for each row, each column, and each diagonal in the grid are constructed. Then, each sensor node in each row, column, and diagonal in the grid establishes a pairwise key with the other node using the predistributed symmetric polynomial. Simulation results demonstrate the effectiveness of the proposed scheme in increasing the probability of establishing pairwise keys and reducing communication overhead. 相似文献
14.
由于无线传感器网络在电源、计算能力和内存容量等方面的局限性,传统的网络密钥分配和管理方法已不适用.本文从基于身份密钥体系出发,提出了一种适用于无线传感器网络的密钥预分配方法.首先简要介绍了身份密钥体系,特别是Boneh-Franklin算法,然后基于身份密钥系统和Diffie-Hellman算法,给出我们的密钥分配方法,并从方法的复杂性、安全性、健壮性和内存需求等方面,与随机算法等进行了分析比较,结果表明我们的算法在这些方面有一定的优势.最后我们讨论了可进一步研究的内容. 相似文献
15.
在无线传感器网络中,节点被敌方捕获以后将泄露节点内存储的群组密钥等秘密信息,所以需要建立一种安全高效的群组密钥管理系统来及时对被捕获节点进行撤销,以保证无线传感器网络中群组通信的安全.提出一种基于逻辑密钥树结构的密钥预分配方案,群组控制者和密钥服务器(GCKS)为逻辑密钥树中每一逻辑节点分配一个密钥集,每一sensor节点对应一个叶节点,以及一条从该叶节点到根节点的路径,GCKS将该路径上所有节点的密钥植入sensor节点.节点撤销时,GCKS将逻辑密钥树分成互不相连的子树,利用子树中sensor节点的共享密钥进行群组密钥的更新.分析表明本方案满足无状态性,以及正确性、群组密钥保密性、前向保密性和后向保密性等安全性质,具有较低的存储、通信和计算开销,适用于无线传感器网络环境. 相似文献
16.
This letter presents a pairwise key establishment scheme that is robust against the compromise of nodes in mobile ad hoc networks. Each node establishes local keys with its neighbor nodes that are at most three hops away at network boot‐up time. When any two nodes establish a pairwise key, they receive the secret information from the nodes on the route between them, and construct the pairwise key using the secret information. Here, the local keys are utilized by the nodes on the route to send the secret information securely. The simulation results have proven that the proposed scheme provides better security than the key pre‐distribution‐based scheme. 相似文献
17.
The establishment of secure links between neighboring nodes is one of the most challenging problems in wireless sensor networks.
In this article, we present an efficient key predistribution scheme for sensor networks such that pairwise keys are defined
by iterated hash computations based on a tree structure. Our scheme can be regarded as an improvement of HARPS, Ramkumar and
Memon (IEEE J Sel Area Commun 23(3):611–621, 2005),or a generalization of Leighton and Micali’s scheme (Lect Notes Comput
Sci 773:456–479, 1994). We rigorously analyze our scheme focusing on the resiliency of the network and hash computational
complexity for each node and compare the performance with existing schemes. Specifically, we show that our scheme provides
stronger resiliency and requires less hash computational complexity than HARPS. 相似文献