• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.93-102
• /
• 2007

A serious problem to fight DDoS attacks is that attackers use incorrect or spoofed IP addresses in the attack packets. Due to the stateless nature of the internet, it is a difficult problem to determine the source of these spoofed IP packets. The most of previous studies to prevent and correspond to DDoS attacks using the traceback mechanism have been accomplished in IPv4 environment. Even though a few studies in IPv6 environment were introduced, those have no detailed mechanism to cope with DDoS attacks. The mechanisms for tracing the origin of attacks in IPv6 networks have so many differences from those of IPv4 networks. In this paper we proposed a lightweight IP traceback mechanism in IPv6 network environment. When marking for traceback is needed, the router can generate Hop-by-Hop option and transmit the marked packet. We measured the performance of this mechanism and at the same time meeting the efficient marking for traceback.

• Review of KIISC
• /
• v.15 no.1
• /
• pp.50-60
• /
• 2005

본 논문에서는 최근 인터넷 환경에서 증가하고 있는 대규모 컴퓨터 바이러스/웜에 의한 침해사고 발생 시 네트워크 포렌식 등에서 정의되어야할 정보와 이를 활용한 대량 트래픽을 발생시키는 시스템을 탐지하는 방안을 제안하였다. 이에 따라 종합 침해사고 대응 시스템에서의 자동화된 역추적 절차를 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.27-34
• /
• 2005

Current security reinforcement systems are Passive defense system that only blocks filter to all traffic from the attacker. So, Those are weak re-attack and Stepping Stones attack because active response about attacker is lacking. Also, present techniques of traceback need much time and manpower by log information collection and trace through the personal inspection and active response is lacking. In this paper, We propose technique for TCP connection traceback that can apply in present internet and trace to inserted marking on IP header to correspond re-attack and Stepping Stones attack. Therefore, Proposed technique is unnecessary correction of existing network component and can reduce size of marked information and overhead of resources.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.487-489
• /
• 2002

본 논문에서는 액티브코드를 이용한 실시간 역추적시스템에 대하여 논한다. 본 시스템은 우회공격의 연결특성을 이용하여 TCP 응용프로그램의 응답메시지에 액티브코드를 덧붙였다. 덧붙여진 액티브코드는 침입자의 근원지 소스측으로 실시간 이동하면서 네트워크 중간노드에서 침입자의 공격에 유연하게 대응한다. 또한, 본 시스템에서는 데이터은닉기법을 적용하여 중간 경유호스트에서 별도의 역추적 시스템을 도입할 필요가 없도록 기존의 환경에 투명성을 부여하였다. 이러한 방법을 통해, 기존의 호스트기반역추적 시스템의 신뢰성문제와 deployment문제를 해결하였다. 본 시스템을 통하여 기존의 네트워크환경에 최소한의 변경으로 침입자의 공격에 실시간적이며 능동적인 대응을 할 수 있다.

• Water for future
• /
• v.52 no.1
• /
• pp.23-25
• /
• 2019

• Water for future
• /
• v.52 no.1
• /
• pp.35-39
• /
• 2019

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.277-280
• /
• 2008

Security policy that use defense system such as Intrusion Detection System or Firewall is limited to passive response that only manage important data and resources. This paper analyzes security problem and maximum of passive response, provides a responsive way to Pharming attack which is one kind of hacking. This paper also includes ICMP-based traceback system that uses ICMP traceback Message about invasion that is decided through hacking. With this paper we can intercept damage of personal information leakage and property loss that is done through Pharming attacks.

• KSCI Review
• /
• v.2 no.1
• /
• pp.121-129
• /
• 1995

Fault simulation of logic circuits is an important part of the test-generation process. It is used for the propose of generation fault dictionaries or for the verification of the adequacy of tests. In this paper, a backtrace fault simulation is proposed to test generation. This is consists of 3 part ; initialization phase for given circuit, backtrace fault simulation phase to find fault list and reevaluation phase to list event. The main idea of this algorithm is to retain a minimum fault list by cutting uncontrollable lines of path when a logic event occurs in backward tracing phases. And the simulator is revaluates a fault list associated with the output of an element only if logic event occurs at any of its inputs when a list event occurs at one of its primary inputs. It reguires a O(n) memory space complexity. where n is a number of signal lines for the given circuits. Several examples are given to illustrate the power of this algorithm.

• The Journal of Society for e-Business Studies
• /
• v.22 no.4
• /
• pp.129-139
• /
• 2017

With the advent of FinTech, many financial services have become available in the mobile Internet environment and recently, there is an internet bank that provides all bank services online. As the proportion of financial services over the Internet increases, it offers convenience to users, but at the same time, the threat of financial network is increasing. Financial institutions are investing heavily in security systems in case of an intrusion. However attacks by hackers are getting more sophisticated and difficult to cope with. However, applying an IP Trace-back method that can detect the actual location of an attacker to a financial network can prepare for an attacker's arrest and additional attacks. In this paper, we investigate IP Trace-back technology that can detect the actual location of attacker and analyze it to apply it to financial network. And we propose a new IP Trace-back method through Infra-structure construction through simulation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.772-779
• /
• 2012

In the current MANET, DOS or DDOS attacks are increasing, but as MANET has limited bandwidth, computational resources and battery power, the existing traceback mechanisms can not be applied to it. Therefore, in case of traceback techniques being applied to MANET, the resource of each node must be used efficiently. However, in the traceback techniques applied to an existing ad hoc network, as a cluster head which represents all nodes in the cluster area manages the traceback, the overhead of the cluster head shortens each node's life. In addition, in case of multi-hop clustering, as one Cluster head manages more node than one, its problem is getting even worse. This paper proposes TNA(Traceback against Network Attacks) based on multihop clustering using the depth of tree structure in order to reduce the overhead of distributed information management.