Malware, con’t
CS 161: Computer Security
- Prof. Vern Paxson
Malware, cont CS 161: Computer Security Prof. Vern Paxson TAs: - - PowerPoint PPT Presentation
Malware, cont CS 161: Computer Security Prof. Vern Paxson TAs: Jethro Beekman, Mobin Javed, Antonio Lupher, Paul Pearce & Matthias Vallentin http://inst.eecs.berkeley.edu/~cs161/ April 18, 2013 Large-Scale Malware Worm = code
The worm dies off globally! Measurement artifacts Number of new hosts probing 80/tcp as seen at LBNL monitor of 130K Internet addresses
– Classic SI model: homogeneous random contacts
– N: population size – S(t): susceptible hosts at time t. – I(t): infected hosts at time t. – β: contact rate
per unit time
– s(t) = S(t)/N i(t) = I(t)/N s(t) + i(t) = 1
N = S(t) + I(t) S(0) = I(0) = N/2
Increase in # infectibles per unit time Total attempted contacts per unit time Proportion of contacts expected to succeed
Fraction infected grows as a logistic
Exponential initial growth Growth slows as it becomes harder to find new victims!
Emergent behavior
What could have caused growth to deviate from the model?
Hint: at this point the worm is generating 55,000,000 scans/sec
Answer: the Internet ran
(Thus, β decreased.) Access links used by worm completely clogged. Caused major collateral damage.
2009 - 2010
2012 - 2013
retain control over botnet
– Detecting infection of individual bots hard as it’s the defend-against- general-malware problem – Detecting bot doing C&C likely a losing battle as attackers improve their sneakiness & crypto – Cleanup today lacks oomph:
– Difficult due to ease of Internet anonymity & complexities of international law
– One promising angle: policing domain name registrations
– Bots require installing new executables or modifying existing ones – Perhaps via infection …
– Sacrifices flexibility – How does this work for home users? – Can we leverage trusted kernels + white lists / code signing?
– Does this solve the problem? – Depends on how granular the privileges are … and how the decision is made regarding just what privileges are “least”