Earticle

무선센서 네트워크에서 안전한 데이터 수집은 중요한 보안이슈 중에 하나이다. 일반적으로 안전한 데이터 수집이란 데이터 자체의 보안과 안전한 전송 경로 확보를 의미한다. 본 논문은 이와 같은 관점에서 무선센서 네트워 크에서 안전한 데이터 수집 프로토콜을 제안한다. 제안하는 프로토콜은 계층형 센서네트워크를 고려한 계층형 키 보 안 기법과 안전을 보장할 수 있는 전송경로 설정을 핵심적으로 제시한다. 프로토콜은 네트워크 부하를 최소화 할 수 있도록 최적화 되었으며 네트워크 공격으로 인해 발생하는 문제점을 효과적으로 차단한다. 성능평가 결과 제안하는 프로토콜은 네트워크 퍼포먼스를 고려한 데이터 수집에 효율적이다. 데이터 수집 시 안전을 확보하기 위한 보안 분 석 역시 검증해 보았다.

A secure data gathering in a Wireless Sensor Network(WSN) has given attention to one of security issues. In general, the process of secure data gathering causes difficulties: one process is exchanging the secured data and the other is constructing secured data path. The previous studies have been resolving the difficulties in terms of two problems: security and data gathering in WSNs. However, a WSN requires a protocol that has to guarantee a security of path between sensors and sink, or a cluster head. Thus how to gather data securely is an important issue. In this paper, we propose a secure data gathering protocol over WSNs, which consists of hierarchical key settlement and secure path construction, and aims at tackling two problems. The proposed protocol causes little overhead to sensor nodes for secured key settlement and path construction. This work provides security analysis focused on the key settlement protocol and evaluates network performance for the proposed data gathering protocol through simulation.

Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use the Group Key (GK) for encrypting and decrypting messages while providing enough security to protect against passive attacks. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH assumes all members have an equal computing power. One of the characteristics of distributed computing and grid environments is heterogeneity; the member can be at a workstation, a laptop or even a mobile computer. Member reordering in the TDGH protocol could potentially lead to an improved protocol; such reordering should capture the heterogeneity of the network as well as latency. This research investigates dynamic reordering mechanisms to consider not only the overhead involved but also the scalability of the proposed protocol.

Group communications are becoming popular in Internet applications such as video conferences, on-line chatting programs, games, and gambling. Secure and efficient group communication is needed for message integration, confidentiality, and system usability. However, the conventional group key agreement protocols are too much focused on minimizing the computational overhead by concentrating on generating the common group key efficiently for secure communication. As a result, the common group key is generated efficiently but a failure in authentication allows adversaries to obtain valuable information during the group communication. After achieving the secure group communication, the secure group communication should generate the group key efficiently and distribute it to group members securely, so the balance of security and system usage must be considered at the same time. Therefore, this research proposes the software architecture model of a secure and efficient group communication that will be imbedded into networking applications.

국내에서 공장자동화에 대한 관심이 증가하고 있으며, 이에 관한 개발이 활발하게 시도되고 있다. 특히, '제조업 혁신 3.0 전략'에 따라 중소기업의 제조 공장들에 대한 스마트화에 대한 관심이 급격히 증가하고 있다. 뿐만 아니라, 스마트 공장을 구 축하기 위한 정책적, 기술적, 전략적 접근 방법을 모색하고 있다. 하지만 이와 같은 스마트 공장 또는 공장 자동화 시스템을 도입하기 위해서는 제조 공장이 갖는 보안 취약점과 개인정보 보호 문제는 반드시 선결해야만 한다. 그러므로 우리는 공장 자 동화를 위해서 가장 많이 도입되고 있는 무선 통신 기술인 RFID 통신 프로토콜에 적용 가능한 경량 암호 프로토콜을 제안한 다. 본 논문에서 제안한 경량 암호 프로토콜은 기존의 공개키 기반 시스템이나 대칭키 암호 알고리즘과 비교해서 연산 횟수가 적고 처리 속도가 빠르다. 뿐만 아니라 낮은 전력 소비량과 저장 공간을 소비하도록 설계하였다.

There has been a growing interest in automation of factories in the country. And, the development in this regard has been actively attempted. In particular, on the basis of the "innovation 3.0 strategy of manufacturing industry", interest in the smart of the manufacturing plant of small and medium-sized enterprises has increased rapidly. As well as policy for building smart plant, technical, seeking a strategic approach. But, in order to introduce such a smart plant or factory automation systems, manufacturing plant security with vulnerability and personal information protection problems, it should always be top priority there. Accordingly, we provide the applicable lightweight secure protocols in RFID communication. It is a wireless communication technology that is most often introduced for factory automation. Our proposed lightweight secure protocol in this study, less the number of calculations in comparison with the existing public key-based and the symmetric key encryption algorithm. And it is fast in compare with the existing protocol. Furthermore, we design that it system can support to low power consumption and small consume the memory size.

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

Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamictopology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communicationpath and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposedattack detection technique using secure authentication infrastructure for efficient detection and prevention of internalattack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority andthe public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity ofdata between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2simulator is used to evaluate performance of proposed method and excellent performance can be performed throughthe experiment.

The existing PKI authentication structure uses the OCSP method. The primary task of OCSP is to verify the status of a transaction after verifying the validity of the certificate; but, because of continuing policy changes and updates within the PKI authentication method, the status of certificates and the structures are not consistent. Therefore, the SCVP method can be selected as the broadest method for completing authentication tasks accurately because the SCVP method includes validation of policy changes. An appropriate method for building an mobile environment within the capabilities of low-memory and reduced processing CPU needs to be assessed and developed. This thesis proposes a verification method that is independent of platform and applicable to any 05 in building and expanding the mobile environment.

IoT (Internet of Things) 환경에서 센서노드들과 주고받는 데이터에 대한 보안의 중요성이 높아지고 있다. IoT에 기본이 되는 IEEE 802.15.4에서는 센서노드와 PAN Coordinator 또는 센서노드와 센서노드간의 안전한 통신을 위한 키가사전에 공유되어 있음을 가정하고 있다. 특히, 네트워크 가입 과정에서 센서노드에 대한 개별 인증이 고려되지 않는 문제점이 존재한다. 본 논문에서는 모든 디바이스에게 사전 공유된 키가 있음을 가정한 기존 연구들의 문제점을 해결한안전한 가입 프로토콜을 제안한다.

The security of the data exchanged between sensor nodes in IoT (Internet of Things) environment becomes increasing. In the conventional IEEE 802.15.4, the key for secure communication between the sensor node and the sensor node and the PAN Coordinator or the sensor node is assumed to be pre-shared in advance. Especially, there is another problem in that sensor node authentication is not considered during the association process. In this paper, we propose a security scheme that solves the problems of previously proposed protocols with the pre-shared key for all devices.

최근 RFID/USN 환경에서 정보보호는 네트워크 보안 및 RFID 정보보호 기술로 구분될 수 프로토콜 설계가 활발히 연구되고 있다. 그러나, 저가의 RFID 태그의 생산과 사용자 프라이버시 보호를 위한 안전한 인증 프로토콜의 개발은 미흡한 실정이다. 따라서, 본 논문에서는 기존의 인증 프로토콜보다 RFID 태그에서 계산량을 감소시키고 통신 오버헤드를 감소시키므로 개인 프라이버시 보호를 위한 효제안하였다.

Recently, the security for RFID/USN environment is divided into network security and RFID security. The authentication protocol design for RFID security is studied to protect user privacy in RFID system. However, the study of efficient authentication protocol fot RFID system is not satisfy a security for low-cost RFID tag and user privacy. Therefore, this paper proposes a secure matrix-based RFID authentication protocol that decrease communication overhead and computation. In result, the Matrix-based RFID authentication protocol is an effective authentication protocol compare with HB and HB+ in traffic analysis attack and trace location attack.

Wireless sensor networks (WSNs) are a technology of various uses from monitoring surrounding environment to collecting data. Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. However, WSNs which communicate through a wireless transmission medium are quite vulnerable in terms of security compared to wired networks and their sensor nodes have very limited communication and computing capacities and a small memory space. For these reasons, it is difficult to apply the established public key encryption technology. Accordingly, a large number of sensor nodes should be tolerable to errors and failures, and it is essential to achieve effective management and reinforced security functions through autonomous network construction. The cluster-based routing protocol proposed in this study showed energy-efficient key management by establishing a common shared key through the key of key ring or through authentication by a reliable institution.

Two-way quantum secure communication protocol and one-way quantum secure communication protocol based on single photon sequence and the XOR operation have been proposed, one-way communication can confuse the eavesdroppers and two-way communication only a single authentication and there is not visible to eavesdropping and delayed photon attack Trojan horse attack. The new agreement the use of single photon sequence and no regularity not only to achieve unconditional security, and semantics confuse eavesdroppers and has a high transmission efficiency, easy implementation, especially suitable for use in noisy channels.

Many various kinds of network applications have arisen due to rapid development of network techniques. For preventing sensitive personal information from being disclosed on an open and unsecure network, it is necessary to provide some appropriate secure protocols. Concerning secure protocols, key agreement and authentication between user and server are paramount. In 2010, Cui and Cao proposed a secure anonymous key agreement for distributed networks, in which users collect other identities to utilize in communication so attackers cannot determine the real identity of the user. However, this protocol suffers the drawback of high calculation requirements. In this paper, we adopt Elliptic Curve Cryptography (ECC) to reduce the computational cost in Cui and Cao’s protocol, and propose an indexing trick to speed up searches of legitimate users. Our proposed scheme maintains the characteristic of obfuscating user identity to thwart identification attempts.

This paper aims to analyze vulnerability of overlay networks for the existing P2P service and suggest a secure and efficient ESCORT network. Encryption functions are used to provide encryption, explicit mutual authentication and session keys are provided to ensure secure communication, and a middle object is suggested to maintain efficiency. Moreover, Time stamps are used for each communication process to provide effective network security service. Thus, the proposed ESCORT network provides not only security for P2P users but also other advantages such as user privacy protection, secure communication and effective security management through centralized control.

Secure group communication allows a set of nodes (or devices) to communicate securely amongst each other over unprotected and open networks. Provision of security for group communication is based on cryptographic services, which relies on careful management of cryptographic keying material. Securing group communication in wired networks is fairly well understood, however wireless networks introduce further challenges as group members may move from one place to another while still remaining in a group session. In this paper we propose a host mobility protocol to govern group member movement in wireless mobile environments. We introduce the use of lists as part of our protocol design in order to facilitate host mobility.

In this paper, we propose a formally verified protocol to securely manage vertical handovers heterogeneous networks (HetNets), even when different cryptographic algorithms are used in the infrastructure. The protocol presentation goes with a review of the current propositions of security mechanisms and procedures dedicated to manage vertical handovers. From a critical analysis, the HetNets are positioned in the context of wireless security to describe the possible attacks that afflict this new kind of infrastructure. From this analysis, it is revealed that the different entities involved in the management of handovers are surrounded by new security challenges. This challenges and the positioning of HetNets helps to deliver a new suited protection. Securing vertical handovers means to deal with the different cryptographic algorithms from the security architecture of the different technologies that protect the sessions of communications.

The security issues are more complex and challenging in Mobile Ad hoc Networks (MANETs) than other conventional wireless networks due to peer to peer behavior of the participating nodes, absence of centralized routers and routing through intermediate nodes. For successful communication between a pair of source and destination it is vital that the intermediate nodes be trustworthy and don’t drop packets. Nodes in an ad hoc network may not be trustworthy either due to selfishness created by power loss or due to maliciousness relating to rogue intentions. A node that was earlier trust worthy may no longer be so at later stages due to loss of power making the continuous dynamic evaluation of trust a necessity. Also the security requirements may vary as per the conditions on the scenario. This paper proposes an intelligent protocol that takes care of both selfishness and maliciousness by evaluating the trust dynamically. The protocol is able to adjust the trust level requirement as per the demand of the situation and can work in various levels of insecure environments. With the help of exhaustive simulations, the performance of this protocol has been demonstrated and compared with the normal AODV protocol in standard lab environment.

Ad hoc networks are highly dynamic routing networks cooperated by a collection of wireless mobile hosts without any assistance of a centralized access point. Secure Efficient Ad hoc Distance Vector (SEAD) is a proactive routing protocol, based on the design of Destination Sequenced Distance Vector routing protocol (DSDV). SEAD provides a robust protocol against attackers trying to create incorrect routing state in the other node. However, it does not provide a way to prevent an attacker from tampering the next hop or the destination field in route update. In this paper, we propose an I-SEAD protocol to solve the problem. A series of simulation experiments are conducted to evaluate the performance.

Wireless ad hoc network is most important present minimizing energy consumption. Among various clustering methods, the low-energy adaptive clustering hierarchy (LEACH) mechanism takes the hierarchical approach of segmenting multiple clusters for efficient energy management. The mechanism, however, configures new clusters in every round, so the energy consumed whenever configuring clusters shortens the useful lifetime of the entire network. For this reason, this paper generates clusters and selects candidate cluster head (CCH) in the initial round under the ad-hoc network environment. Subsequent rounds continue, without performing re-clustering, until all of the candidate cluster heads selected become cluster head (CH), thereby addressing the issue of energy consumption in the setup phase for clustering. The proposed model consumes around 30% more energy than the conventional LEACH in the initial round, but its total energy consumption declines in as the round continues. The network simulation tool (NS-2) proves that its energy efficiency improves by up to 13.3% in the 1,000-node environment compared to when 100 sink nodes are employed.