Detecting Stepping-Stone with Chaff Perturbations
Authors:
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3224, 85-90
Abstract
Attackers on the Internet like to indirectly launch network intrusions by using stepping-stones. In this paper, we propose a novel approach to decrease the packet bound by performing a transformation of packet difference of two streams of a host in order to distinguish stepping-stone connections. The adjustment is critical in the case of chaff perturbation by the intruder. Previous work requires the assumption that the total chaff packets be limited by a given number. We replaced the assumption by using a given chaff rate. It is found that after transformation, the bound range is much smaller for attacking connection, resulting in smaller probability of false negative detection.Keywords
This publication has 4 references indexed in Scilit:
- Stepping-Stone Detection Via Request-Response Traffic AnalysisLecture Notes in Computer Science, 2007
- Detecting Encrypted Stepping-Stone ConnectionsIEEE Transactions on Signal Processing, 2007
- Holding intruders accountable on the Internet2002
- Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay2002