Loading

Shuffle-Selective-Search Process for Mitigation of APTs with IKC
Abdul Khadar1, Shrishail Math2, H. Srinivasa Murthy3

1Abdul Khadar A, Ph.D Scholar, Assistant Professor, Department of ISE, SJCIT, Chickballapur (Karnataka), India.
2Dr. Shrishail Math, Prof. Department of ECE, SKIT, Bangalore (Karnataka), India.
3H Srinivasa Murthy, Associate Professor, Department of Computer Science and Engineering, SJCIT, Chickballapur (Karnataka), India.
Manuscript received on 21 May 2019 | Revised Manuscript received on 11 June 2019 | Manuscript Published on 27 June 2019 | PP: 86-89 | Volume-8 Issue-1C May 2019 | Retrieval Number: A10170581C19/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Data forensics is a process of recognizing, protecting, recovering, evaluating, and presenting features of magisterial digital information. This data could lead to sensitive information of an organization or a person. The APTs are intended to invade the system or environment of this data and try to be in the environment till the successful theft. Advanced Persistent Threats (APTs) follow the Intrusion Kill Chain (IKC) to be successful. This paper proposes a prospecting “shuffle-selective-search” dissection to be inducted in phases of IKC to identify the intrusion-point in the system. Where- in which an effort is made to identify the APT attack as it follows the IKC, by the Shuffle-Selective-Search dissection when there is an intrusion at the intrusion-point within the forensic data repository.
Keywords: Shuffle-Selective-Search, APTs, IKC, Intrusion-Point.
Scope of the Article: Process & Device Technologies