• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.445-448
• /
• 2008

The key establishment between nodes is one of the most important issues to secure the communication in wireless sensor networks. Some researcher used the probabilistic key sharing scheme with a pre-shared key pool to reduce the number of keys and the key disclosure possibility. However, there is a potential possibility that some nodes do not have a common share in the key pool. The purpose of this paper is to devise a peer to peer key sharing protocol (PPKP) based on Quorum system and Diffie-Hellman key exchange scheme (DHS). The PPKP establishes a session key by creating a shared key using the DHS and then scrambles it based on Quorum system to secure that. The protocol reduces the number of necessary keys than the previous schemes and could solve the non-common key sharing possibility problem in the probabilistic schemes.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.98-106
• /
• 2009

Process Control Systems (PCSs) or Supervisory Control and Data Acquisition (SCADA) systems have recently been added to the already wide collection of wireless sensor networks applications. The PCS/SCADA environment is somewhat more amenable to the use of heavy cryptographic mechanisms such as public key cryptography than other sensor application environments. The sensor nodes in the environment, however, are still open to devastating attacks such as node capture, which makes designing a secure key management challenging. In this paper, a key management scheme is proposed to defeat node capture attack by offering both forward and backward secrecies. Our scheme overcomes the pitfalls which Nilsson et al.'s scheme suffers from, and is not more expensive than their scheme.

• ETRI Journal
• /
• 제33권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.

• 정보보호학회논문지
• /
• 제15권2호
• /
• pp.53-64
• /
• 2005

센서 네트워크에서 기존의안전한 라우팅 방식은 고정된 싱크(sink)를 가정하였다. 그러나 실제 센서 네트워크가 활용되는 많은 분야에서 싱크는 차량에 의해 이동되는 경우가 많다. 싱크의 이동은 감지된 데이터를 전달하기 위한 라우팅 경로의 재구성, 싱크의 위치 노출, 안전한 액세스 포인트 노드의 선택과 같은 기존의 연구에서 고려하지 않은 추가적인 문제점을 발생시틴다. 본 논문에서는 양방향 해쉬 체인과 그리드(grid) 형태의 위임 노드(delegation mode)를 이용하여 위의 문제점을 해결하는 기법을 제안한다. 요청-응답 프로토콜과 이벤트유도 프로토콜로 구성된 이 기법은 싱크의 이동에 따른 라우팅 경로를 안전하게 재구성해주고, 싱크의 위치 정보가 노출되지 않도록 보호해준다. 성능면에서 제안하는 기법은 경로를 저장하여 이용하는 라우팅 방식보다 통신 횟수가 적어 자원을 절약 할 수 있다. 본 논문은 제안한 시스템의 안전성 분석과 시뮬레이션을 통한 성능평가 결과를 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권11호
• /
• pp.2769-2792
• /
• 2013

In this paper, we propose an authenticated key agreement scheme, TinyIBAK, based on the identity-based cryptography and bilinear paring, for large scale sensor networks. We prove the security of our proposal in the random oracle model. According to the formal security validation using AVISPA, the proposed scheme is strongly secure against the passive and active attacks, such as replay, man-in-the middle and node compromise attacks, etc. We implemented our proposal for TinyOS-2.1, analyzed the memory occupation, and evaluated the time and energy performance on the MICAz motes using the Avrora toolkits. Moreover, we deployed our proposal within the TOSSIM simulation framework, and investigated the effect of node density on the performance of our scheme. Experimental results indicate that our proposal consumes an acceptable amount of resources, and is feasible for infrequent key distribution and rekeying in large scale sensor networks. Compared with other ID-based key agreement approaches, TinyIBAK is much more efficient or comparable in performance but provides rekeying. Compared with the traditional key pre-distribution schemes, TinyIBAK achieves significant improvements in terms of security strength, key connectivity, scalability, communication and storage overhead, and enables efficient secure rekeying.

• 융합보안논문지
• /
• 제8권1호
• /
• pp.143-152
• /
• 2008

Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and authentication. This thesis presents a new centralized approach which focuses on the group key distribution with revocation capability for Wireless Sensor Networks. We propose a new personal key share distribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In contrast to related approaches, our scheme can overcome the security shortcomings while keeping the small overhead requirements per node. It will be shown that our scheme is unconditionally secure and achieves both forward secrecy and backward secrecy. The analysis is demonstrated in terms of communication and storage overheads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2375-2393
• /
• 2016

Key agreement is paramount in secure wireless communications. A promising approach to address key agreement schemes is to extract secure keys from channel characteristics. However, because channels lack randomness, it is difficult for wireless networks with stationary communicating terminals to generate robust keys. In this paper, we propose a Robust Secure Key Agreement (RSKA) scheme from Received Signal Strength (RSS) in stationary wireless networks. In order to mitigate the asymmetry in RSS measurements for communicating parties, the sender and receiver normalize RSS measurements and quantize them into q-bit sequences. They then reshape bit sequences into new l-bit sequences. These bit sequences work as key sources. Rather than extracting the key from the key sources directly, the sender randomly generates a bit sequence as a key and hides it in a promise. This is created from a polynomial constructed on the sender's key source and key. The receiver recovers the key by reconstructing a polynomial from its key source and the promise. Our analysis shows that the shared key generated by our proposed RSKA scheme has features of high randomness and a high bit rate compared to traditional RSS-based key agreement schemes.

• 한국콘텐츠학회논문지
• /
• 제12권1호
• /
• pp.48-58
• /
• 2012

다양한 센싱 모듈의 개발과 무선 통신 기술의 발달로 인해, 한정된 통신 능력과 제한된 연산 능력을 갖춘 다수의 센서 노드를 활용하여 무선 센서 네트워크를 구성하는 것이 가능하게 되었다. 이러한 센서 노드는 무인 환경이나 적지와 같은 환경에 배포되기 때문에 보안에 취약하다. 특히 실생활 응용에 사용될 때, 데이터가 노출되면 치명적인 피해를 입을 수 있기 때문에 보안에 대한 고려는 필수적이다. 하지만 기존 네트워크에서의 보안 기법은 센서 노드의 제한된 성능을 고려하지 않기 때문에, 무선 센서 네트워크에 적용하는 것은 한계가 있다. 이러한 점을 해결하기 위해, 본 논문에서는 무선 센서의 제한된 성능을 고려한 에너지 효율적인 보안 기법을 제안한다. 제안하는 기법은 원본 데이터의 해독을 어렵게 하기 위해 단-방향 해쉬 함수인 MD5를 기반으로 데이터를 변환 후, 분할하여 다중 경로를 통해 전송함으로써 보안성을 강화하는 것이 가능하다. 성능 평가 결과, 제안하는 기법은 기존 기법의 약 6%의 에너지만 소비하였다.

• 한국정보과학회논문지:정보통신
• /
• 제36권2호
• /
• pp.108-117
• /
• 2009

데이터 병합은 무선 센서 네트워크 상에서 정보 전송시 소요되는 에너지를 줄이기 위해 잘 알려진 기법 중에 하나이다. 무선 센서 네트워크가 신뢰할 수 없고, 심지어 위험 환경에 노출되고 있으나, 기존 데이터 병합 기법은 센서 노드와 베이스 스테이션 종단간 데이터 프라이버시(데이터 기밀성 및 무결성)를 제공하지 못하는 문제점을 갖고 있다. 최근 들어 연구되고 있는 데이터 동상 암호체계 기법이 상기 위험 환경에서 종단간 프라이버시를 제공하기 위한 한 방법이 될 수 있다. 본 논문에서는 데이터 병합시 데이터 기밀성과 무결성을 보장하기 위하여 기존 동상 암호체계 기법 및 타기법 분석을 통하여 가능한 조합을 제시하고 CPU 부하 및 통신비용 측면에서 그 성능을 평가한다.