• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1245-1246
• /
• 2009

센서 네트워크는 유비쿼터스 컴퓨팅에서 핵심적인 역할을 담당하는 기반 네트워크이다. 그 때문에 센서 네트워크로부터 제공되는 정보는 신뢰할 수 있어야 한다. 하지만 센서 자체의 여러 가지 한계로 인해 보안의 핵심 요소인 키 관리에는 많은 어려움이 존재한다. 이 논문에서는 Random Key Predistribution 기법에 기반하여 악의적인 노드를 탐지하지 못하는 기존의 한계점을 분석하고, 이를 해결하기 위한 새로운 키 관리 기법을 제안한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.2
• /
• pp.165-169
• /
• 2009

In this short paper, we revisit the random key predistribution methods for wireless sensor networks with regard to their intrinsic phase called the path-key establishment. First we show that the path-key establishment is less practical than expected and may degrade the performance of key establishment significantly. We then propose a novel path-key establishment method for those schemes and analyze its advantageous performance improvement.

• ETRI Journal
• /
• v.33 no.5
• /
• pp.791-801
• /
• 2011

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.646-648
• /
• 2010

A Sensor Node in Wireless Sensor Network has very limited resources such as processing capability, memory capacity, battery power, and communication capability. When the communication between any two sensor nodes are required to be secured, the symmetric key cryptography technique is used for its advantage over public key cryptography in terms of requirement of less resources. Keys are pre-distributed to each sensor node from a set of keys called key pool before deployment of sensors nodes. Combinatorial design helps in a great way to determine the way keys are drawn from the key pool for distributing to individual sensor nodes. We study various deterministic key predistribution techniques that are based on combinatorial design.

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

Wireless Sensor Network(WSN) consists of huge number of sensor nodes which are small and inexpensive with very limited resources. The public key cryptography is undesirable to be used in WSN because of the limitations of the resources. A key management and predistribution techniques are required to apply the symmetric key cryptography in such a big network. Many key predistribution techniques and approaches have been proposed, but most of-them didn't consider the real WSN assumptions, In this paper, we propose a security framework that is based on a hierarchical grid for WSN considering the proper assumptions of the communication traffic and required connectivity. We apply simple keying material distribution scheme to measure the value of our framework. Finally, we provide security analysis for possible security threats in WSN.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6B
• /
• pp.249-257
• /
• 2008

Nowadays, client-to-client applications such as online chat (e.g. MSN) and SMS (Short Message Services) are becoming increasingly prevalent. These client-to-client applications are revolutionizing the way we communicate. Three-party PAKE (password authenticated key exchange) protocols provide a means for the two communicating parties holding passwords to establishment a secure channel between them with the help of a common server. In this paper, we propose an efficient three-party PAKE protocol for the client-to-client applications, which has much better performance than the existing generic constructions. We also show that the proposed protocol is secure in a formal security model.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.105-113
• /
• 2009

The previous key management methods are not appropriate for secure data communication in cluster-based routing scheme. Because cluster heads are elected in every round and communicate with the member nodes for authentication and share-key establishment phase in the cluster. In addition, there are not considered to mobility of nodes in previous key management mechanisms. In this paper, we propose the secure and effective key management mechanisim in the cluster-based routing scheme that if there are no share keys between cluster head and its nodes, we create the cluster key using authentication with base station or trust autentication and exchange the their information for a round.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.591-594
• /
• 2006

무선 센서 네트워크에서는 센서 노드의 제약으로 인해 공개키 알고리즘을 쓰기에는 적합하지 않다. 비밀키 방식을 사용할 경우 가장 문제가 되는 부분은 키 분배 문제이다. 한 가지 방법은 센서 노드들이 배치되기 전에 미리 센서 노드들에 키를 심어 놓음으로써 해결할 수 있다. 본 논문은 키 체인을 이용해 이러한 방식을 개선하여 더욱 향상된 보안성을 제공하는 프로토콜을 제시한다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.71-74
• /
• 2006

무선 센서 네트워크는 미래의 유비쿼터스 컴퓨팅에서 핵심적인 역할을 할 것으로 알려져 있으며, 그에 따라 센서 네트워크에서의 안전한 통신도 중요한 문제로 떠오르고 있다. 이러한 센서 네트워크에서의 안전한 통신을 위해서는 각 센서 노드 사이에서의 안전한 키 관리 프로토콜이 필수적이다. [1]에서는 기존에 제안된 key-predistribution 방식보다 효율적인 키 합의 프로토콜을 제안했다. 그런데, [1]에서 제안된 PIKE 프로토콜에서 각 센서 노드 사이의 통신에 대한 가정을 현실적으로 바꾸면 보다 효율적인 프로토콜을 얻을 수 있다. 네트워크의 전체 센서 노드의 수를 n이라고 했을 때, [1]에서 제안된 프로토콜에서 각 센서 노드의 메모리 소요량은 O($\sqrt{n^}$)이나, 본 논문에서는 키 합의 매개 노드의 수와 메모리 소요랑 사이의 trade-off 관계를 보이고 최적의 프로토콜을 구성하는 방법에 대해 논의한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6B
• /
• pp.233-248
• /
• 2008

Advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks (WSNs). There are numerous applications for wireless sensor networks, and security is vital for many of them. However, WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture, and the lack of infrastructure, all of which impose unique security challenges and make innovative approaches desirable. In this paper, we present a survey on security issues in wireless sensor networks. We address several network models for security protocols in WSNs, and explore the state of the art in research on the key distribution and management schemes, typical attacks and corresponding countermeasures, entity and message authentication protocols, security data aggregation, and privacy. In addition, we discuss some directions of future work.