• Title/Summary/Keyword: 네트워크 구간

Search Result 505, Processing Time 0.031 seconds

Intel SGX를 이용한 온라인 게임 보안 향상 방안

  • Kang, Su In;Kim, Huy Kang
    • Review of KIISC
    • /
    • v.27 no.4
    • /
    • pp.22-26
    • /
    • 2017
  • 온라인 게임은 가장 성공적인 인터넷 서비스 중 하나로서 빠른 속도로 성장해 왔다. 그러나 게임을 대상으로 하는 다양한 공격들이 있었고 그로 인해 많은 정상 사용자들 및 게임서비스 회사에 피해가 발생함에 따라, 온라인 게임 서비스를 보호하기 위한 다양한 기법들이 연구되어 왔다. 실제로 대규모 이용자들이 접속하는 PC 게임들의 경우, 게임 클라이언트단, 네트워크 단, 서버 단 각 구간별로 다양한 보안 기법들이 개발되어 적용되어 왔다. 이 중, 게임 클라이언트는 사용자 및 해커 쪽에서 손쉽게 접근이 가능하기 때문에 공격에 쉽게 노출되어 있어 신뢰하기 어려운 구간이었다. 더불어, 게임 클라이언트 단에 강력한 보안을 적용할 경우 성능저하가 발생하기 때문에 상용 게임보안 솔루션에 의해 프로세스 및 메모리 보호를 받는 등 역공학 방지 기법 및 난독화 기법 정도만을 최소한으로 적용하고, 그 외에는 대부분의 탐지 및 차단 기법들을 네트워크 단 및 서버 단에 적용하는 것이 일반화 되어 있다. 하지만, 최근 하드웨어의 지원을 받아 클라이언트 단의 성능저하를 최소화 하면서도, 게임 클라이언트를 TEE (Trusted Execution Environment)에서 안전하게 실행할 수 있는 기술들이 등장하면서, 게임 클라이언트 단의 보안기술이 다시 주목받고 있다. 본 논문에서는 메모리 변조 공격 및 게임프로세스에 인젝션 공격을 하는 게임해킹 기법들에 대응하기 위하여 Intel에서 발표한 새로운 하드웨어 보안 기술인 Intel SGX(Software Guard Extensions)를 적용하는 방안에 대해 소개한다. Intel SGX를 적용하여 게임프로그램의 프로세스를 보호할 경우 코드와 데이터의 무결성 및 기밀성을 보장하며 실행시킬 수 있기 때문에, 온라인게임보안 발전에 상당히 기여할 수 있을 것으로 기대된다.

Energy Efficient MAC Protocols based on S-MAC for Wireless Sensor Networks (무선 센서 네트워크에서의 S-MAC 기반의 에너지 효율적인 MAC 프로토콜)

  • Park, Jae-Hong;Lew, Kyeung-Seek;Kim, Yong-Deak
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.2 s.314
    • /
    • pp.19-24
    • /
    • 2007
  • In this paper, we deal with suggestion of energy efficient MAC protocol. The scheme(I-MAC) makes the active duty-cycle duration based on by utilizing data frequency. Data frequency is made by checking a check bit of Link layer. By being studies on NS-2 simulation environments, the proposed scheme was proved to be improved in terms of energy efficiency of 50 % and to be similar to throughput of S-MAC on every time interval.

Mobile WiMAX 보안 이슈와 해결 방안

  • Son, Tae-Sik;Choe, Uk;Choe, Hyo-Hyeon
    • Information and Communications Magazine
    • /
    • v.24 no.11
    • /
    • pp.5-13
    • /
    • 2007
  • 광대역 무선 접속 표준을 관장하는 IEEE 802.16 워킹 그룹은 IEEE 802.16 표준을 2004년에 발표하였으며 이 IEEE 802.16 표준안에는 현재 WiMAX(Worldwide Interoperability for Microwave Access)라 불리는 고정 및 저속 이동 접속에 대한 광대역 무선 통신 지원 기술이 포함되어 있다. 특히 여러 기술 중 보안 관점에서 IEEE 802.16 표준은 MAC 계층 안에 PKM(Privacy Key Management)라고 불리는 Security Sub-layer를 가지고 있다. PKM은 PKMv1과 PKMv2로 구분되며, 먼저 PKMv1은 기본적인 인증 및 기밀성 기능을 제공하고 IEEE 802.16 표준에 기본적으로 적용되어있다. 하지만, IEEE 802.16 표준 이후 많은 연구들이 PKMv1의 보안성에 대하여 의문을 제기하였고 이에 따라 IEEE 802.16 표준안의 확장 개선안으로서 완전한 이동성을 바탕으로 하는 2005년 발표된 IEEE 802.16e 표준안에서는 향상된 보안 기능을 제공하는 PKMv2를 제공하며 기존 표준안의 부족한 점을 보완하기 위하여 시도하였다. 이러한 PKMv2는 EAP(Extensible Authentication Protocol) 인증, AES(Advanced Encryption Standard) 기반 기밀성 제공 알고리즘, CMAC/HMAC(Cipher/Hashed Message Authentication Code)을 사용한 메시지 인증 기능 제공 등 보다 다양한 보안 기능을 제공하였다. 그러나 IEEE 802.16e 표준안의 보안 기능은 SS(Subscriber Station)과 BS(Base Station)간의 통신구간 보안에 초점을 맞추어서 네트워크 도메인간의 보안 문제나 핸드오버시 보안과 같은 네트워크 구조적 보안 취약성을 여전히 가지고 있다. 하지만 표준안에서 정의하고 있는 SS와 BS 구간 보안 역시 완전한 솔루션을 제시하고 있지는 않다. 본 논문에서는 이러한 취약성을 고찰하고 그에 따른 대응방안을 제시하였다.

A Wireless Network Structure and AKA(Authentication and Key Agreement) Protocol of Advanced Metering Infrastructure on the Smart Grid based on Binary CDMA (스마트 그리드를 위한 Binary CDMA 기반의 AMI 무선 네트워크 구조 및 AKA 프로토콜)

  • Jeon, Jae-Woo;Lim, Sun-Hee;Yi, Ok-Yeon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.5
    • /
    • pp.111-124
    • /
    • 2010
  • AMI (Advanced Metering Infrastructure) is a core infrastructure of Smart Grid, and is promoting in various country. Wireless network is considered for cost savings and operational efficiencies in AMI. But various security problems are expected in wireless networks of AMI, so we should solve these problems. In this paper, we suggest a wireless network of AMI by using Binary CDMA and security countermeasures of AMI wireless network. Proposed security architecture is using BSIM (Binary Subscriber Identity Module) to perform user authentication and key agreement for the encryption and decryption over radio network to reduce security threats.

Efficient Network Configuration Method for Mobile Nodes in Sensor Networks (센서 네트워크의 이동 노드를 위한 효율적 네트워크 구성 방법)

  • Lee, Jae-Hyung;Lee, Eung-Soo;Kim, Dong-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.113-123
    • /
    • 2010
  • In this paper, an efficient network configuration method is proposed for mobile nodes in LR-WPAN (Low Rate Wireless Personal Area Network) based on the IEEE 802.15.4 standard. The proposed MSBS (mobile sensor beacon setup) method can be used to implement a joining procedure by which an improved processing rate can be achieved. This improvement is achieved by using BOP (Beacon only Period). In this method, the performance of mobile nodes is enhanced by using information on depth, traffic, and RSSI (Received Signal Strength Indication). By using the MSBS method, trusted data can be transferred and traffic overloads that occur at specific nodes can be prevented. The information obtained from the mobile nodes in wireless networks is analyzed using the proposed method, in order to study the performance of the method. Simulation results show that the MSBS method can be used to obtain an efficient network configuration according to the mobility of nodes in LR-WPAN.

A FCA-based Classification Approach for Analysis of Interval Data (구간데이터분석을 위한 형식개념분석기반의 분류)

  • Hwang, Suk-Hyung;Kim, Eung-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.19-30
    • /
    • 2012
  • Based on the internet-based infrastructures such as various information devices, social network systems and cloud computing environments, distributed and sharable data are growing explosively. Recently, as a data analysis and mining technique for extracting, analyzing and classifying the inherent and useful knowledge and information, Formal Concept Analysis on binary or many-valued data has been successfully applied in many diverse fields. However, in formal concept analysis, there has been little research conducted on analyzing interval data whose attributes have some interval values. In this paper, we propose a new approach for classification of interval data based on the formal concept analysis. We present the development of a supporting tool(iFCA) that provides the proposed approach for the binarization of interval data table, concept extraction and construction of concept hierarchies. Finally, with some experiments over real-world data sets, we demonstrate that our approach provides some useful and effective ways for analyzing and mining interval data.

Network Planning on the Open Spaces in Geumho-dong, Seoul (서울 금호동 오픈스페이스 네트워크 계획)

  • Kang, Yon-Ju;Pae, Jeong-Hann
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.40 no.5
    • /
    • pp.51-62
    • /
    • 2012
  • Geumho-dong, Seoul, a redeveloped residential area, is located in the foothills of Mt. Eungbong. The geographical undulation, the composition of a large apartment complex, and the partial implementation of the redevelopment project have caused the severe physical and social disconnections in this area. In order to recover functioning in the disconnected community, this study pays attention to the regeneration of the open spaces as an everyday place and in the form a network system among those open spaces. Various types of the open spaces are classified into points or faces, 'bases' and linear 'paths' analyze the network status. More than half of the open space have connecting-distance of 500m or more. Furthermore, many areas are not even included in the service-area of the open spaces. Analysis of the connectivity and integration value using the axial map has carried out to check weak linkages and to choose the sections where additional bases are required. In addition, to improve the quality of the bases and the paths, a field investigation is conducted and problems are diagnosed. The network planning of the open spaces in Geumho-dong is established, ensuring the quality and quantity of bases and paths. The plan includes the construction of an additional major base in the central area and six secondary bases in other parts, and comes up with ways to improve the environment of underdeveloped secondary bases. In the neighborhood parks at Mt. Daehyun areas, the major path are added, and the environment of the paths is improved in certain areas. Because of the network planning, the connecting-distances between bases are reduced significantly, the connectivity and integration value of the area are increased, and the service areas of the open spaces cover the whole area properly. Although this study has some limitations such as the needs for the legal and institutional supports and difficulties of a quantitative indexing process, its significance lies in the suggestion of a more reasonable and practical plan for the overall network system by defining complex types of open spaces simply and clearly and by examining the organic relationships quantitatively and qualitatively.

Implementation of Absolute Delay Differentiation Scheme in Next-Generation Networks (차세대 네트워크에서의 절대적 지연 차별화 기능 구현)

  • Paik, Jung-Hoon;Kim, Dae-Ub;Joo, Bheom-Soon
    • 전자공학회논문지 IE
    • /
    • v.45 no.1
    • /
    • pp.15-23
    • /
    • 2008
  • In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

The Dynamic Allocation Algorithm for Efficient Data Transmission in Wireless Sensor Network (무선 센서 네트워크에서 효율적인 데이터 전송을 위한 동적 할당 알고리즘)

  • Kim, Ji-Won;Yoon, Wan-Oh;Kim, Kang-Hee;Hong, Chang-Ki;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.3
    • /
    • pp.62-73
    • /
    • 2012
  • IEEE 802.15.4 standard which has low-speed, low-power, low-cost can be efficiently used in wireless sensor network environment. Among various topologies used in IEEE 802.15.4 standard, a cluster-tree topology which has many nodes in it, transmit delay, energy consumption and data loss due to traffic concentration around the sink node. In this paper, we propose the MRS-DCA algorithm that minimizes conflicts between packets for efficient data transmission, and dynamically allocates the active period for efficient use of limited energy. The MRS-DCA algorithm allocates RP(Reservation Period) to the active period of IEEE 802.15.4 and guarantees reliable data transmission by allocating RP and CAP dynamically which is based on prediction using EWMA. The comparison result shows that the MRS-DCA algorithm reduces power consumption by reducing active period, and increasing transmission rate by avoiding collision.

Adaptive Input Traffic Prediction Scheme for Proportional Delay Differentiation in Next-Generation Networks (차세대 네트워크에서 상대적 지연 차별화를 위한 적응형 입력 트래픽 예측 방식)

  • Paik, Jung-Hoon
    • Convergence Security Journal
    • /
    • v.7 no.2
    • /
    • pp.17-25
    • /
    • 2007
  • In this paper, an algorithm that provisions proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that adjusts the target delay every time slot to compensate the deviation from the target delay which is caused by the prediction error on the traffic to be arrived in the next time slot. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential rate traffic. It is demonstrated through simulations that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA and the performance is verified under the test board based on the XPC860P CPU.

  • PDF