• 한국콘텐츠학회논문지
• /
• 제9권1호
• /
• pp.115-122
• /
• 2009

본 논문에서는 유비쿼터스 환경에서 OTP가 적용된 Diffie-Hellman 방식을 이용하여 노드간 키를 전달할 때 타임스탬프의 시간 차이를 이용하여 악의적인 노드를 검출할 수 있는 방법을 제안한다. 기존의 방식들은 정확한 시간 동기화나 방향성 안테나를 이용한 방법으로 악의의 노드 검출을 시도하였다. 본 논문에서는 방향성 안테나 추가 혹은 제 3 신뢰기관(TTP) 없이 타임스탬프를 이용한 OTP를 Diffie-Hellman 방식에 적용하여 중간의 악의노드 검출 방법을 제안하고 이에 대한 안전성을 검증한다. 본 논문에서 제안하는 방법은 유비쿼터스 환경에서도 쉽게 적용이 가능한 방법이다.

• 디지털산업정보학회논문지
• /
• 제13권1호
• /
• pp.49-57
• /
• 2017

IoT can be connected through a single network not only objects which can be connected to existing internet but also objects which has communication capability. This IoT environment will be a huge change to the existing communication paradigm. However, the big security problem must be solved in order to develop further IoT. Security mechanisms reflecting these characteristics should be applied because devices participating in the IoT have low processing ability and low power. In addition, devices which perform abnormal behaviors between objects should be also detected. Therefore, in this paper, we proposed D-IDS technique for efficient detection of malicious attack nodes between devices participating in the IoT. The proposed technique performs the central detection and distribution detection to improve the performance of attack detection. The central detection monitors the entire network traffic at the boundary router using SVM technique and detects abnormal behavior. And the distribution detection combines RSSI value and reliability of node and detects Sybil attack node. The performance of attack detection against malicious nodes is improved through the attack detection process. The superiority of the proposed technique can be verified by experiments.

• ETRI Journal
• /
• 제37권1호
• /
• pp.77-87
• /
• 2015

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.1461-1464
• /
• 2005

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories, but those are not well-suited for securing ad hoc networks. Moreover, a fundamental issue of securing mobile ad hoc networks is to ensure mobile nodes can authenticate each other. Because of its strength and efficiency, public key and digital signature is an ideal mechanism to construct the authentication service. Although this is already mature in the internet application, providing public key based authentication is still very challenging in mobile ad hoc networks. In this paper I propose a secure public key authentication service based on clustering model and trust model to protect nodes from getting false public keys of the others efficiently when there are malicious nodes in the network.

• 디지털산업정보학회논문지
• /
• 제7권4호
• /
• pp.31-37
• /
• 2011

Recently, MANET(Mobile Ad-hoc Network) is developing increasingly in the wireless network. MANET has weakness because phases change frequently and MANET doesn't have middle management system. Every node which consists of MANET has to perform data forwarding, but traceback is not reliable if these nodes do malicious action owing to attack. It also is not easy to find location of attacker when it is attacked as moving of nodes. In this paper, we propose a hierarchical-based traceback method that reduce waste of memory and can manage path information efficiently. In order to manage trace path information and reduce using resource in the cluster head after network is formed to cluster, method which recomposes the path efficiently is proposed. Proposed method in this paper can reduce path trace failure rate remarkably due to moving of nodes. It can also reduce the cost for traceback and time it takes to collect information.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.87-93
• /
• 2013

MANET has the advantage of having the flexibility to build easily a network in a difficult situation that builds a wired network. But, data transmission errors by movement of nodes and eavesdropping by wireless communications have become a problem of security. Authentication service is the most essential in order to overcome these problems and operate network stably. In this paper, we propose 3-tiers authentication structure to exclude of malicious node and operate stable network through more systematic and thorough node authentication. After network is composed into a cluster, cluster head which play CA role is elected. Among these, the highest-CA is elected. The highest-CA receives certificates to cluster head and the cluster head evaluates trust value of their member nodes. Authentication technique which issues member node key is used. We compared PSS and experimented to evaluate performance of proposed scheme in this paper and efficiency of the proposed technique through experience was confirmed.

• ETRI Journal
• /
• 제33권5호
• /
• pp.826-829
• /
• 2011

Distributed systems particularly suffer from Sybil attacks, where a malicious user creates numerous bogus nodes to influence the functions of the system. In this letter, we propose a Bloom filter-based scheme, SybilBF, to fight against Sybil attacks. A Bloom filter presents a set of Sybil nodes according to historical behavior, which can be disseminated to at least n (e-1)/e honest nodes. Our evaluation shows that SybilBF outperforms state of the art mechanisms improving SybilLimit by a factor of (1/e)${\gamma}$ at least.

• 디지털산업정보학회논문지
• /
• 제10권4호
• /
• pp.89-96
• /
• 2014

MANET has been applied to a wide variety of areas because it has advantages which can build a network quickly in a difficult situation to build a network. However, it is become a victim of malicious nodes because of characteristics such as mobility of nodes consisting MANET, limited resources, and the wireless network. Therefore, it is required to lightweight attack detection technique which can accurately detect attack without causing a large burden to the mobile node. In this paper, we propose a multistage attack detection techniques that attack detection takes place in routing phase and data transfer phase in order to increase the accuracy of attack detection. The proposed attack detection technique is composed of four modules at each stage in order to perform accurate attack detection. Flooding attack and packet discard or modify attacks is detected in the routing phase, and whether the attack by modification of data is detected in the data transfer phase. We assume that nodes have a public key and a private key in pairs in this paper.

• 융합보안논문지
• /
• 제14권7호
• /
• pp.17-22
• /
• 2014

MANET은 빠르게 네트워크를 구축할 수 있다는 특징 때문에 많은 분야에서 활용되고 있다. 그러나 무선 네트워크의 특성과 노드들의 이동으로 인해 많은 보안 위협에 노출되어 있다. 특히 그중에서도 라우팅 프로토콜의 취약점을 이용한 공격이 증가하고 있으며 그 피해 또한 매우 증가하고 있는 설정이다. 본 논문에서는 안전한 라우팅 프로토콜 제공을 위한 two-level 인증 구조를 제안하였다. 제안한 기법에서는 네트워크에 참여하는 노드들에 대하여 신뢰도를 기반으로 한 인증 평가를 실시하여 인증서를 발급해주며, 인증서를 발급받은 노드만이 데이터 전송을 수행하게 된다. 그리고 인증서를 발급받은 노드가 데이터 전송시 제어 패킷의 정보와 자신이 관리하는 PIT 정보를 비교 및 분석하여 악의적인 노드들에 대한 탐지를 수행하게 된다. Ns-2 시뮬레이터를 이용하여 본 논문에서 제안한 기법의 성능을 평가하였으며, 실험을 통하여 우수한 성능을 확인하였다.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.422-429
• /
• 2013

Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.