• ETRI Journal
• /
• v.28 no.3
• /
• pp.375-378
• /
• 2006

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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.32-40
• /
• 2006

It is very important to establish a pairwise key securely in wireless sensor networks. Because sensor networks consist of devices with weak physical security, they are likely to be compromised by an attacker. However, some approaches using key pre-distribution and other approaches using one hop local keys are known to be very vulnerable to threats caused by compromised nodes, even a small number. This paper proposes a scheme where each node establishes three hop local keys and employs them for a later pairwise key establishment. When any two nodes agree a pairwise key, all nodes on the route between two nodes contribute to the agreement of the pairwise key. Here, the initial three hop local keys are employed for encrypting a secret key delivered from a node to other nodes. Therefore, the proposed scheme bothers attackers to compromise much more nodes than the scheme using one hop local keys only. The simulation results have proven that the proposed scheme provides better performance and higher security than the scheme using one hop local keys in terms of message exchange, the number of encryption and decryption, and pairwise key exposure rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.6
• /
• pp.975-980
• /
• 2020

To protect wireless sensor networks (WSNs), various key distribution and management schemes have been proposed. However, most of them conducted simulations and experiments for performance evaluation by considering only the two-dimensional (2D) environments. In this paper, we investigate the effect of real-world three-dimensional (3D) topographic features on the key pre-distribution schemes for WSNs. For this purpose, we analyze and compare the performance of three pairwise key pre-distribution schemes in 2D and 3D environments: full pairwise (FP), random pairwise (RP), and full and random pairwise (FRP) schemes. For the experiments, we employ a network simulator NS-3 and 3D graphic tools such as Blender and Unity. As a result, we confirm that there was a difference in the performance of each scheme according to the actual 3D terrain and that the location-based FRP that considers deployment errors, has the highest efficiency in many aspects.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.165-172
• /
• 2010

Sensor network can be applied in many areas in our life, and security is very important in applying sensor network. For secure sensor communication, pairwise key establishment between sensor nodes is essential. In this paper, we cluster the network field in hexagonal shapes and preassign three different kinds of key information for each sensor according to its expected location. We adopt overlapped key string pool concept for our clustered network architecture and every node uses the part of sub-strings for setting up pairwise keys with all neighboring nodes in its own cluster and from different clusters according to respective position with small amount of information. Our proposal decreases the memory requirement and increases security level efficiently.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.484-486
• /
• 2005

본 논문에서는 센서네트워크를 위한 기존의 클러스터 라우팅 기법에 multi-hop pairwise key를 적용시킴으로써 multi-hop pairwise key를 기반으로 하는 클러스터를 구성하고 이를 통한 클러스터 간의 통신을 제안한다. 이는 암호화된 클러스터 통신을 위한 키 분배에 있어서 메모리 효율성을 높이고, 클러스터 라우팅의 난제였던 클러스터 헤드 선택과 관리를 효과적으로 할 수 있게 한다.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.195-202
• /
• 2006

For applying sensor networking technology for our daily life, security service is essential, and pairwise key establishment is the key point for security. In this paper, we propose fairwise key establishment mechanism for secure coumunication in sensor networks. In the mechanism, we cluster the network field before deployment and predistribute key materials to normal sensor nodes and clusterheads. For clusterheads, more key materials are predistributed, and after deployment, sensor nodes which need to establish pairwise keys with other sensor nodes in different clusters make request for related key materials to their own clusterheads. Our proposal reduces the memory requirements for normal sensor nodes by distributing more information to clusterheads, and it raises the security level and resilience against node captures. In addition, it guarantees perfect pairwise key establishments for every pair of neighboring nodes and provides efficient and secure sensor communications.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.473-480
• /
• 2005

We can obtain useful information by deploying large scale sensor networks in various situations. Security is also a major concern in sensor networks, and we need to establish pairwise keys between sensor nodes for secure communication. In this paper, we propose new pairwise key establishment mechanism based on clustering and polynomial sharing. In the mechanism, we divide the network field into clusters, and based on the polynomial-based key distribution mechanism we create bivariate Polynomials and assign unique polynomial to each cluster. Each pair of sensor nodes located in the same cluster can compute their own pairwise keys through assigned polynomial shares from the same polynomial. Also, in our proposed scheme, sensors, which are in each other's transmission range and located in different clusters, can establish path key through their clusterheads. However, path key establishment can increase the network overhead. The number of the path keys and tine for path key establishment of our scheme depend on the number of sensors, cluster size, sensor density and sensor transmission range. The simulation result indicates that these schemes can achieve better performance if suitable conditions are met.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.552-555
• /
• 2006

센서네트워크는 유비쿼터스 컴퓨팅 사회에서 핵심 기술로 부각되고 있다. 이러한 센서네트워크는 노드들이 노출되거나 데이터 전송 시 일반 네트워크보다 보안에 취약하므로 안전한 통신을 위하여 센서 노드간 키를 설정하는 것은 보안을 위한 기본적인 요구사항이 되고 있다. 본 논문에서는 배치된 센서네트워크에서 셋업서버의 오버헤드를 줄이기 위하여 네트워크를 클러스터링하고 각 셀 안에 클러스터 헤더와 노드들을 배치한 후 클러스터내의 노드사이의 안전한 통신을 하기위한 pairwise key를 설정하는 기법을 제안하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.873-876
• /
• 2005

무선 센서 네트워크 (Wireless Sensor Network)에서 기존에 존재하는 대부분의 보안 프로토콜들은 대칭적인 공유키(symmetric pairwise key) 설정에 기반하고 있다. 그러나 이러한 프로토콜들은 노드 전복 (node compromising), 그리고 과중한 트래픽의 문제점을 안고 있다. 더욱이, 대칭키 방법을 이용한 브로드캐스트 메시지 인증은 자원이 제약된 센서네트워크에서 적용하기에는 너무 복잡하다. 본 논문은 공개키를 이용한 공유키(Pairwise Key) 설정에 기반한 보안 프로토콜들을 제안한다. 특히 경량성을 위하여 타원 곡선 암호 (Ellptic Curve Cryptography)를 채택하였다. 제안 프로토콜은 공유키 설정과 브로드캐스트 메시지 인증을 위하여 각각 Elliptic Curve Diffie-Hellman (ECDH)과 Elliptic Curve Digital Signature Algorithm (ECDSA)를 이용한다. 더욱이, 분산된 rekeying 메커니즘 (decentralized rekeying mechanism)을 도입함으로써 TinySec 의 성능을 향상시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.1165-1168
• /
• 2007

센서노드들이 배치되었을 때 초기 보안 요구사항은 이웃 노드 사이의 보안키를 안전하고 효율적으로 설정하는 것이다. 이를 위해 본 논문에서는 클러스터 단위로 직접키를 공유함으로써 공유하는 센서 수를 줄임과 동시에 다항식이 노출 되어도 전체 센서 네트워크에 끼치는 영향을 최소화하여 안전성을 보장하게하고 컴퓨팅 오버헤드를 줄일 수 있게 하였다. 또한 가용성 보장을 위해 불필요한 키관리 동작을 지양하고 센서 노드의 에너지 소모를 감소시키기 위하여 근접 클러스터 헤더 노드와의 사전 키 분배를 통해 경로키를 설정하게 함으로써 센서노드간의 안전하고 효율적인 pairwise key 설정을 통해 안전한 통신이 가능하게 하였다.