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

  • Authors:
  • Yongzhong Zhang;Jianhua Yang;Chunming Ye

  • Affiliations:
  • College of Management, the University of Shanghai for Science and Technology, Shanghai, China;Department of Computer Science, University of Houston, Houston, TX;College of Management, the University of Shanghai for Science and Technology, Shanghai, China

  • Venue:
  • ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

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.