Paper Info
Title
Stepping-stone detection algorithm based on order preserving mapping
Abstract
Intruders often do not attack victim hosts directly from their own hosts so as not to reveal their identity. Instead, intruders perform their attacks through a sequence of intermediary hosts before attacking the target. This type of attack is known as a "stepping-stone attack". Stepping-stone detection is to determine if a host machine is being used as a stepping-stone by attackers. In this paper, we propose an algorithm for stepping-stone detection using a pervious mapping-based detection method. The technique reduces the detection problem to finding a mapping between two streams of packets. If our algorithm cannot find the mapping, then no such mapping exists. But if there is a mapping, then the proposed algorithm is guaranteed to find one and the solution will always be the one with minimum indexed. We provide the proof of the correctness of the algorithms. Furthermore, the algorithm has a low time complexity. The paper also discusses the effect of chaff packets on the ability to detect stepping-stones.
Year
DOI
Venue
2007
10.1109/ICPADS.2007.4447772
ICPADS
Keywords
Field
DocType
order preserving mapping,intrusion detection,mappings,power consumption,mobile device,mobile phone,critical issue,stepping-stone detection algorithm,heterogeneous dual-core processor,computational complexity,algorithm,connection chain,stepping-stone,chaff packets,security of data,delta modulation,upper bound,helium,computer science,design methodology,cryptography
Upper and lower bounds,Cryptography,Computer science,Network packet,Correctness,Delta modulation,Algorithm,Time complexity,Intrusion detection system,Computational complexity theory,Distributed computing
Conference
Volume
ISSN
ISBN
2
1521-9097 E-ISBN : 978-1-4244-1890-9
978-1-4244-1890-9
Citations 
PageRank 
References 
7
0.57
12
Authors
3
Name
Order
Citations
PageRank
Ying-Wei Kuo1413.89
Shou-Hsuan270.57
Shou-hsuan Stephen Huang317459.88