Exploiting temporal consistency to reduce false positives in host-based, collaborative detection of worms

  • Authors:
  • David J. Malan;Michael D. Smith

  • Affiliations:
  • Harvard University, Cambridge, Massachusetts;Harvard University, Cambridge, Massachusetts

  • Venue:
  • Proceedings of the 4th ACM workshop on Recurring malcode
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The speed of today's worms demands automated detection, but the risk of false positives poses a difficult problem. In prior work, we proposed a host-based intrusion-detection system for worms that leveraged collaboration among peers to lower its risk of false positives, and we simulated this approach for a system with two peers. In this paper, we build upon that work and evaluate our ideas ``in the wild.'' We implement Wormboy 2.0, a prototype of our vision that allows us to quantify and compare worms' and non-worms' temporal consistency, similarity over time in worms' and non-worms' invocations of system calls. We deploy our prototype to a network of 30 hosts running Windows XP with Service Pack 2 to monitor and analyze 10,776 processes, inclusive of 511 unique non-worms (873 if we consider unique versions to be unique non-worms). We identify properties with which we can distinguish non-worms from worms 99% of the time. We find that our collaborative architecture, using patterns of system calls and simple heuristics, can detect worms running on multiple peers. And we find that collaboration among peers significantly reduces our probability of false positives because of the unlikely appearance on many peers simultaneously of non-worm processes with worm-like properties.