Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The loop fallacy and serialization in tracing intrusion connections through stepping stonesPublished by Association for Computing Machinery (ACM) ,2004
- Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delaysPublished by Association for Computing Machinery (ACM) ,2003
- Holding intruders accountable on the InternetPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable DelayLecture Notes in Computer Science, 2002
- Inter-Packet Delay Based Correlation for Tracing Encrypted Connections through Stepping StonesLecture Notes in Computer Science, 2002
- Sleepy Watermark Tracing: An Active Network-Based Intrusion Response FrameworkIFIP — The International Federation for Information Processing, 2001
- Finding a Connection Chain for Tracing IntrudersLecture Notes in Computer Science, 2000
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995
- Occam's RazorInformation Processing Letters, 1987
- A theory of the learnableCommunications of the ACM, 1984