Resistance analysis to intruders' evasion of a novel algorithm to detect stepping-stone

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most intruders used to make use of stepping-stones to launch their attacks for safety reason. Some of them even evade stepping-stone detection by conducting manipulations. Most of the approaches proposed to detect stepping-stone are vulnerable in detecting intruders' evasion, such as time perturbation, and chaff perturbation. In this paper, we propose a new algorithm to detect stepping-stone by comparing the self and cross packet matching rates of a session. The analysis and simulation results show that this algorithm detects not only stepping-stone without misdetection, but also intruder's evasion with less limitation. It can resist to intruders' time perturbation completely, as well as chaff perturbation. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Zhang, Y., Yang, J., & Ye, C. (2006). Resistance analysis to intruders’ evasion of a novel algorithm to detect stepping-stone. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4158 LNCS, pp. 477–486). Springer Verlag. https://doi.org/10.1007/11839569_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free