Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds

  title={Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds},
  author={Avrim Blum and Dawn Xiaodong Song and Shobha Venkataraman},
Intruders on the Internet often prefer to launch network intrusions indirectly, i.e., using a chain of hosts on the Internet as relay machines using protocols such as Telnet or SSH. This type of attack is called a stepping-stone attack. In this paper, we propose and analyze algorithms for stepping-stone detection using ideas from Computational Learning Theory and the analysis of random walks. Our results are the first to achieve provable (polynomial) upper bounds on the number of packets needed… CONTINUE READING
Highly Influential
This paper has highly influenced 29 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 206 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 140 extracted citations

206 Citations

Citations per Year
Semantic Scholar estimates that this publication has 206 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…