Stepping-stone detection via request-response traffic analysis

  • Authors:
  • Shou-Husan Stephen Huang;Robert Lychev;Jianhua Yang

  • Affiliations:
  • Department of Computer Science, University of Houston, Houston, TX;Department of Computer Science, University of Massachusetts Amherst, Amherst, MA;Department of Mathematics & Computer Science, Bennett College, Greensboro, NC

  • Venue:
  • ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we develop an algorithm that may be used as a steppingstone detection tool. Our approach is based on analyzing correlations between the cumulative number of packets sent in outgoing connections and that of the incoming connections. We present a study of our method's effectiveness with actual connections as well as simulations of time-jittering (introduction of inter-packet delay) and chaff (introduction of superfluous packets). Experimental results suggest that our algorithm works well in the following scenarios: (1) distinguishing connection chains that go through the same stepping stone host and carry traffic of users who perform similar operations at the same time; and (2) distinguishing a single connection chain from unrelated incoming and outgoing connections even in the presence of chaff. The result suggests that timejittering will not diminish our method's usefulness.