54 research outputs found
A scalable grouping random key predistribution scheme for large scale distributed sensor networks
[[abstract]]The security issue in a distributed sensor network (DSN) has been drawing considerable research attention in recent years. Key management, a basic security service, becomes the core design for various security services, such as encryption and authentication. This paper proposes a scalable grouping random key predistribution scheme which divides all nodes into several groups and uses the oneway Junction to generate group-to-group pairwise keys to increase the connectivity of each key and to enlarge the maximum supportable network size.[[conferencetype]]國際[[conferencedate]]20050704~20050707[[iscallforpapers]]Y[[conferencelocation]]Sydney, Australi
Scalable Grouping Random Key Predistribution in Large Scale Wireless Sensor Networks
[[abstract]]The security issue in a wireless sensor network (WSN) has been drawing considerable research attention in recent years. Key management, a basic security service, becomes the core design for various security services, such as encryption and authentication. To increase the connectivity of each key in a large-scale WSN and to enlarge its maximum supportable network size, this paper presents a scalable grouping (SG) random key predistribution scheme. The SG scheme divides all nodes into several groups and uses the one-way function to generate group-to-group pairwise keys. To improve resilience against node capture, i.e., to fortify the security strength, the scheme takes on the concept that the link key is composed of some shared keys. For any two nodes with two or more shared keys, the SG scheme uses the exclusive-OR operation to compose the link key -- assuring the link key used to secure a link is nearly unique. Experimental results show that the SG scheme is able to generate better resilience against node capture and higher scalability than existing random key based schemes.[[notice]]補正完畢[[incitationindex]]EI[[booktype]]紙
[[alternative]]Design of Fault-Tolerant Routing and Security Protocols in Sensor Networks
計畫編號:NSC93-2213-E032-032研究期間:200408~200507研究經費:631,000[[abstract]]近年來,無線網路技術的研發進展極為迅速,相關應用日益普遍,感測器網路便是 其中之一。有鑒於感測器網路在未來的應用發展,前景熱絡可期,我?計畫運用以往的 研究成果及心得,從兩個方向探索,為增進感測器網路的效能而努力。我?的研究目標 包括:一﹑設計一個可以容錯並且突破現有效率的感測器網路路由協定,以提升網路之 資料彙集速度:我?構想在設計感測器網路路由協定之際,帶入超立方體拓樸之特性, 利用一定之演算步驟,先行確認感測器節點如何依距離構成超立方體拓樸,然後經由類 似超立方體傳輸樹進行資料彙集,並在感測器節點發生故障或死亡時,藉由容錯傳輸樹 或不完全超立方體的方式,加速達成資料彙集的目的。二﹑為強化感測器網路的資訊安 全,本計畫擬將「多重路徑路由」融入所預計研發、以超立方體為基礎之感測器網路路 由,將資料拆開經由不同路徑送至目的端後,再重新組合,以降低資料被劫的危險。此 外亦將深入研究感測器網路之認證與加密兩項議題,參考文獻上既有之無線網路認證協 定與加密協定,經適當調整改進,設計出一套便利可行且適用於具耗電低、便宜特性之 感測器網路的安全協定,以維護感測器網路中資料傳輸的安全。[[sponsorship]]行政院國家科學委員
Resilience against node capture attack using asymmetric matrices in key predistribution scheme in wireless sensor networks
Wireless Sensor Networks (WSN) usually consists of a large number of tiny sensors with limited computation capability, memory space and power resource. WSN's are extremely vulnerable against any kind of internal or external attacks, due to several factors such as resource constrained nodes and lack of tamperresistant packages. To achieve security in Wireless Sensor Networks, it is important to encrypt messages sent among sensor nodes. In this paper, we propose a scheme called Modified Bloom's Scheme (MBS) that uses asymmetric matrices of keys in place of symmetric matrices in order to establish secret keys between node pairs. The network resilience against node capture attack is improved using the proposed scheme.[PUBLICATION ABSTRACT
Resilience against node capture attack using asymmetric matrices in key predistribution scheme in wireless sensor networks
Wireless Sensor Networks (WSN) usually consists of a large number of tiny sensors with limited
computation capability, memory space and power resource. WSN’s are extremely vulnerable against any kind of
internal or external attacks, due to several factors such as resource constrained nodes and lack of tamperresistant packages. To achieve security in Wireless Sensor Networks, it is important to encrypt messages sent
among sensor nodes. In this paper, we propose a scheme called Modified Bloom’s Scheme (MBS) that uses
asymmetric matrices of keys in place of symmetric matrices in order to establish secret keys between node pairs.
The network resilience against node capture attack is improved using the proposed scheme
Adaptable Security in Wireless Sensor Networks by Using Reconfigurable ECC Hardware Coprocessors
Specific features of Wireless Sensor Networks (WSNs) like the open accessibility to nodes, or the easy observability of radio communications, lead to severe security challenges. The application of traditional security schemes on sensor nodes is limited due to the restricted computation capability, low-power availability, and the inherent low data rate. In order to avoid dependencies on a compromised level of security, a WSN node with a microcontroller and a Field Programmable Gate Array (FPGA) is used along this work to implement a state-of-the art solution based on ECC (Elliptic Curve Cryptography). In this paper it is described how the reconfiguration possibilities of the system can be used to adapt ECC parameters in order to increase or reduce the security level depending on the application scenario or the energy budget. Two setups have been created to compare the software- and hardware-supported approaches. According to the results, the FPGA-based ECC implementation requires three orders of magnitude less energy, compared with a low power microcontroller implementation, even considering the power consumption overhead introduced by the hardware reconfiguratio
A key storage and path key efficient diagonal-based grouping for wireless sensor network
Research into the security of wireless sensor networks, often referred to as WSN, has always been a great challenge due to the limited resources and a rich domain of active research. Recently developed probabilistic key predistribution for WSN groupings are not entirely secure. If an adversary can compromise a certain number of sensors, s/he could reconstruct the keys for rest of the sensors. The objective of this thesis was to develop a storage-efficient and low pathkey consuming grouping scheme for a wireless sensor network. In this thesis, a diagonal-based grouping is proposed to improve the security and performance of key distribution based on the work conducted by Liu, Ning, and Du [1]. Two different types of grouping schemes are presented: diagonal-based grouping and diagonalmin grouping. The step-by-step implementation of these groupings in several types of network orientations is also described. This thesis examines the proposed grouping schemes in terms of the key storage and the length of the pathkey. Finally, the outcomes of this thesis demonstrate that the proposed grouping is more key-storage efficient than are the existing schemes. If there is a lot of data flow across the diagonals, the proposed grouping would demonstrate efficient key utilization
A Survey of Cryptography and Key Management Schemes for Wireless Sensor Networks
Wireless sensor networks (WSNs) are made up of a large number of tiny sensors, which can sense, analyze, and communicate information about the outside world. These networks play a significant role in a broad range of fields, from crucial military surveillance applications to monitoring building security. Key management in WSNs is a critical task. While the security and integrity of messages communicated through these networks and the authenticity of the nodes are dependent on the robustness of the key management schemes, designing an efficient key generation, distribution, and revocation scheme is quite challenging. While resource-constrained sensor nodes should not be exposed to computationally demanding asymmetric key algorithms, the use of symmetric key-based systems leaves the entire network vulnerable to several attacks. This chapter provides a comprehensive survey of several well-known cryptographic mechanisms and key management schemes for WSNs
Group Rekeying Schemes for Secure Group Communication in Wireless Sensor Networks
Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory, limited energy resources, and so on. Grouping is an important technique to localize computation and reduce communication overhead in wireless sensor networks. In this paper, we use grouping to refer to the process of combining a set of sensor nodes with similar properties. We propose two centralized group rekeying (CGK) schemes for secure group communication in sensor networks. The lifetime of a group is divided into three phases, i.e., group formation, group maintenance, and group dissolution. We demonstrate how to set up the group and establish the group key in each phase. Our analysis shows that the proposed two schemes are computationally efficient and secure
- …