共查询到20条相似文献,搜索用时 180 毫秒
1.
《计算机应用与软件》2016,(4)
针对基于临时初始密钥的密钥管理协议中初始密钥泄露和删除密钥部分素材后老节点之间不能有效认证并建立点对密钥的问题,提出一种适用无线传感器网络安全性增强的密钥管理协议。协议采用分阶段部署传感器节点,并结合双向密钥链、组密钥更新机制和Shamir多项式门限方案。协议中每个节点携带若干部署阶段的主密钥而非初始密钥,即使节点被捕获,也难以通过其他节点认证进入网络;组密钥更新方案中的广播多项式隐藏了被撤销的节点集合和后向密钥,合法节点通过多项式计算恢复出后向密钥并计算组密钥,使得老节点之间能通过组密钥机制实现认证并再次融入网络,提高了网络连通性。安全性和性能分析表明,协议在保证更好安全性的同时,降低了系统开销,也提高了不可靠信道环境下的自愈合性。 相似文献
2.
3.
4.
现有的基于矩阵LU分解的传感网密钥预分配方案容易遭受LU攻击.针对该问题,采用扰动技术干扰LU分解的结果矩阵,并结合随机共享比特串截取方法,使得共享密钥难以计算,进而提出了一种抗LU攻击的传感器网络密钥预分配方案.通过有效调节噪声因子大小、密钥组件长度、密钥组件计算轮数等参数,节点仅需预分配一定数量的密钥材料,就能以较高的安全概率建立配对密钥.经过与典型方案的对比分析与讨论,结合可行性分析,证明了所提方案不仅适用于传感器网络,更能够有效抵抗窃听攻击、LU攻击和节点捕获攻击. 相似文献
5.
无线传感器网络在部署初始阶段,由于未被恶意者察觉或者破解存在难度,节点通常能够在一定时间内具有抵抗劫持的能力。该文基于此分析提出一种适合于静态网络的基于一次性预共享密钥的安全管理方案SMOPK,方案在无线传感器网络部署的初始阶段利用一次性预共享密钥进行密钥协商等,从而在相邻节点间建立保密的安全连接,建立与实际拓扑一致的安全拓扑。分析表明SMOPK方案具有开销小安全性强的特点,适合于静态无线传感器网络的安全要求。 相似文献
6.
7.
无线传感器网络广泛应用于目标跟踪、环境监测、军事感应和地震活动测试等方面。网络安全是无线传感器网络应用的关键因素。在无线传感器网络安全结构中,节点的密钥分布是其中的重要一环。资源有限的大规模无线传感器网络的部署需要高效的节点密钥分布机制。高效的节点密钥分布方案能加强网络连通性、提高抵抗节点捕获攻击的能力、减小节点能量的消耗以及扩展节点通信范围。本文分析了密钥分布的安全要求,着重从密钥的产生、密钥连接的建立和性能方面描述了当前典型的密钥分布方案,并比较和分析了这些算法的特点和安全性能。最后结合该领域当前研究现状,指出无线传感器网络密钥分布未来可能的研究方向。 相似文献
8.
基于密钥预置技术,提出了一种新的传感器网络动态对偶密钥建立算法。在该算法中,节点在部署前首先被预置一个全局初始密钥,在部署之后,邻节点之间将基于预置的全局初始密钥来动态生成一跳的对偶密钥。理论分析与实验结果表明,与已有基于随机方法的传感器网络对偶密钥建立算法相比,新算法具有更好的直接和间接对偶密钥建立概率。 相似文献
9.
随着时间的推移,传感器网络中正常工作的节点越来越少。为了确保网络正常工作,必须适时地添加新节点。针对传感器网络,提出了一个高效的密钥建立方案。该方案构造了n个相互独立的子密钥池,两相邻子密钥池之间存在联系密钥。第j次部署的传感器节点只从第j个子密钥池中选取密钥。理论分析及模拟结果表明与使用固定密钥池的方案相比,该方案的抗毁性显著提高。 相似文献
10.
现有算法在抗节点捕获攻击方面的性能较差,为此,提出一种基于部署知识的密钥预管理算法,将部署区域划分为若干个互不重叠的三角形网格,并将多密钥空间算法用于相邻的网格。理论分析和仿真实验证明,与现有方案相比,该算法可以使网络在保持较高密钥连通度的同时,较好地抵御节点捕获攻击。 相似文献
11.
12.
Younis M.F. Ghumman K. Eltoweissy M. 《Parallel and Distributed Systems, IEEE Transactions on》2006,17(8):865-882
Recent advances in wireless sensor networks (WSNs) are fueling the interest in their application in a wide variety of sensitive settings such as battlefield surveillance, border control, and infrastructure protection. Data confidentiality and authenticity are critical in these settings. However, the wireless connectivity, the absence of physical protection, the close interaction between WSNs and their physical environment, and the unattended deployment of WSNs make them highly vulnerable to node capture as well as a wide range of network-level attacks. Moreover, the constrained energy, memory, and computational capabilities of the employed sensor nodes limit the adoption of security solutions designed for wire-line and wireless networks. In this paper, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Our scheme is termed SHELL because it is Scalable, Hierarchical, Efficient, Location-aware, and Light-weight. Unlike most existing key management schemes for WSNs, SHELL supports rekeying and, thus, enhances network security and survivability against node capture. SHELL distributes key management functionality among multiple nodes and minimizes the memory and energy consumption through trading off the number of keys and rekeying messages. In addition, SHELL employs a novel key assignment scheme that reduces the potential of collusion among compromised sensor nodes by factoring the geographic location of nodes in key assignment. Simulation results demonstrate that SHELL significantly boosts the network resilience to attacks while conservatively consuming nodes' resources. 相似文献
13.
Boqing Zhou Sujun Li Qiaoliang Li Xingming Sun Xiaoming Wang 《Computer Communications》2009,32(1):124-133
Pairwise key establishment is a fundamental security service for sensor networks. However, establishing pairwise key in sensor networks is a challenging problem, particularly due to the resource constraints on sensor nodes and the threat of node compromises. On the other hand, adding new nodes to a sensor network is a fundamental requirement for their continuous operation over time, too. We analyze the weaknesses of security due to node capture when adding sensor nodes using key pre-distribution schemes with “fixed” key pools. In this paper, we propose a new approach, which separates the nodes into groups, the nodes in a group communicate with each other using pairwise keys pre-distributed, the communications between any two neighbor groups are accomplished also through pairwise keys, which is computed based on the pre-distributed Hash chain. We show that the performance (e.g. continuous connectivity, continuous network resilience against node capture and memory usage) of sensor networks can be substantially improved by using our scheme. The scheme and its detailed performance evaluation are presented. 相似文献
14.
介绍了一种用于无线传感器网络(WSNs)的密钥预分配机制:多密钥空间哈希随机密钥预分配(HARPMS)机制。该机制针对group-based节点投放模型,将密钥空间划分成多个子空间,在密钥分配和建立时使用Hash链技术,以提高网络的抗节点俘获能力。分析表明:相比传统的用于group-based投放模型的随机密钥预分配机制,HARPMS获得了同等的连通性,但却有更好的抗节点俘获能力。 相似文献
15.
16.
针对基本随机密钥预分配方案和基于部署信息的密钥管理方案中存在的不足,提出了一种基于六边形部署模型的面向传感器网络的随机密钥预分配方案。该方案更充分地利用了六边形部署模型的特点,通过将部署区域划分为六边形网格,并将传感器节点按其标志号进行分类,然后根据节点期望部署的网格位置和其节点类别进行相应的密钥预分配,从而有效改善了网络的安全性能。分析和仿真表明,在相同的存储开销下,本方案具有更高的安全连通率和更强的抗节点捕获攻击能力。 相似文献
17.
18.
《Parallel and Distributed Systems, IEEE Transactions on》2008,19(10):1411-1425
Wireless sensor networks pose new security and privacy challenges. One of the important challenges is how to bootstrap secure communications among nodes. Several key management schemes have been proposed. However, they either cannot offer strong resilience against node capture attacks, or require too much memory for achieving the desired connectivity. In this paper, we propose a novel key management scheme using deployment knowledge. In our scheme, a target field is divided into a number of hexagon grids and sensor nodes are divided into the same number of groups as that of grids, where each group is deployed into a unique grid. By using deployment knowledge, we drastically reduce the number of potential groups from which a node's neighbors may come. Thus, a pairwise key can be generated efficiently for any two neighbor nodes. Compared with existing schemes, our scheme achieves higher connectivity with a much lower memory requirement and shorter transmission range. It also outperforms others in terms of resilience against node capture attacks. 相似文献
19.
由于传统的密钥管理技术不太适合资源受限的无线传感器网络,因此在保证网络生存周期条件下如何进行密钥预分布和建立成为传感器网络的安全技术研究的一个重要目标.文中提出了一种新的低功耗密钥预分布方案(Low-power Key Pre-distribution Scheme,LKP).该方案把密钥池中的密钥分成具有内在联系的密钥链,前后相邻的密钥链中的密钥以一定概率重叠,每个节点均密钥链的首密钥、重叠密钥部分的初始密钥和初始位置,然后根据密钥链的重叠度来寻找最佳的网络连通性,最后分析了LKP方案的安全性,并从节点的能量损耗、安全方面对LKP方案进行性能仿真.结果表明,LKP方案与q-composite随机密钥预分布方案、多路密钥增强方案相比,降低了能量消耗,增强了网络的安全性能. 相似文献
20.
传统无线传感器网络(WSNs)位置隐私保护方案难以解决安全性与网络能耗之间的均衡,为了提高网络隐私信息的安全性,提出一种鲁棒性强的无线传感器网络位置隐私保护方案.首先通过增加伪源节点和伪汇聚节点防止攻击者获得关键节点的位置信息;然后采用伪汇聚节点分组、概率丢弃冗余数据包降低网络资源消耗;最后在Matlab 2012平台下进行仿真对比实验.结果表明:该方案可以提高网络攻击事件检测率,降低网络时延,有效地保护源节点和汇聚节点的位置隐私. 相似文献