Presentation on theme: "Firewalls and Intrusion Detection Systems David Brumley Carnegie Mellon University."— Presentation transcript:
Firewalls and Intrusion Detection Systems David Brumley firstname.lastname@example.org Carnegie Mellon University
IDS and Firewall Goals Expressiveness: What kinds of policies can we write? Effectiveness: How well does it detect attacks while avoiding false positives? Efficiency: How many resources does it take, and how quickly does it decide? Ease of use: How much training is necessary? Can a non- security expert use it? Security: Can the system itself be attacked? Transparency: How intrusive is it to use? 2
Firewalls Dimensions: 1.Host vs. Network 2.Stateless vs. Stateful 3.Network Layer 3
Firewall Goals Provide defense in depth by: 1.Blocking attacks against hosts and services 2.Control traffic between zones of trust 4
Logical Viewpoint 5 InsideOutside Firewall For each message m, either: Allow with or without modification Block by dropping or sending rejection notice Queue m ?
Placement Host-based Firewall Network-Based Firewall 6 HostFirewallOutside FirewallOutside Host B Host C Host A Features: Faithful to local configuration Travels with you Features: Protect whole network Can make decisions on all of traffic (traffic- based anomaly)
Recall: Protocol Stack 8 Application (e.g., SSL) Transport (e.g., TCP, UDP) Network (e.g., IP) Link Layer (e.g., ethernet) Physical Application message - data TCPdataTCPdataTCPdata TCP Header dataTCPIP dataTCPIPETH Link (Ethernet) Header Link (Ethernet) Trailer IP Header
Stateless Firewall Filter by packet header fields 1. IP Field (e.g., src, dst) 2. Protocol (e.g., TCP, UDP,...) 3. Flags (e.g., SYN, ACK) Application Transport Network Link Layer Firewall OutsideInside Example: only allow incoming DNS packets to nameserver A.A.A.A. Allow UDP port 53 to A.A.A.A Deny UDP port 53 all Fail-safe good practice e.g., ipchains in Linux 2.2 9
Need to keep state 10 InsideOutside Listening Store SN c, SN s Wait SN C rand C AN C 0 Syn SYN/ACK: SN S rand S AN S SN C Established ACK: SN SN C +1 AN SN S Example: TCP Handshake Firewall Desired Policy: Every SYN/ACK must have been preceded by a SYN
Stateful Inspection Firewall Added state (plus obligation to manage) – Timeouts – Size of table State Application Transport Network Link Layer OutsideInside e.g., iptables in Linux 2.4 11
Stateful More Expressive 12 InsideOutside Listening Store SN c, SN s Wait SN C rand C AN C 0 Syn SYN/ACK: SN S rand S AN S SN C Established ACK: SN SN C +1 AN SN S Example: TCP Handshake Firewall Record SN c in table Verify AN s in table
Logical Viewpoint 25 InsideOutside IDS/IPS For each message m, either: Report m (IPS: drop or log) Allow m Queue m ?
Overview Approach: Policy vs Anomaly Location: Network vs. Host Action: Detect vs. Prevent 26
Policy-Based IDS Use pre-determined rules to detect attacks Examples: Regular expressions (snort), Cryptographic hash (tripwire, snort) 27 Detect any fragments less than 256 bytes alert tcp any any -> any any (minfrag: 256; msg: "Tiny fragments detected, possible hostile activity";) Detect IMAP buffer overflow alert tcp any any -> 192.168.1.0/24 143 ( content: "|90C8 C0FF FFFF|/bin/sh"; msg: "IMAP buffer overflow!”;) Example Snort rules
Anomaly Detection 29 Distribution of “normal” events IDS New Event Attack Safe
Example: Working Sets 30 Alice Days 1 to 300 reddit xkcd slashdot fark working set of hosts Alice Day 300 outside working set reddit xkcd slashdot fark 18487
Anomaly Detection Pros Does not require pre- determining policy (an “unknown” threat) Cons Requires attacks are not strongly related to known traffic Learning distributions is hard 31
Automatically Inferring the Evolution of Malicious Activity on the Internet David Brumley Carnegie Mellon University Shobha Venkataraman AT&T Research Oliver Spatscheck AT&T Research Subhabrata Sen AT&T Research
33 Tier 1 EK A... Spam Haven Labeled IP’s from spam assassin, IDS logs, etc. Evil is constantly on the move Goal: Characterize regions changing from bad to good (Δ-good) or good to bad (Δ-bad)
Research Questions Given a sequence of labeled IP’s 1.Can we identify the specific regions on the Internet that have changed in malice? 2.Are there regions on the Internet that change their malicious activity more frequently than others? 34
35 Spam Haven Tier 1 Tier 2 D X BC K Per-IP often not interesting A... DSLCORP A X Challenges 1.Infer the right granularity E Previous work: Fixed granularity Per-IP Granularity (e.g., Spamcop)
36 Spam Haven Tier 1 Tier 2 DE BC W A... DSLCORP A BGP granularity (e.g., Network-Aware clusters [KW’00]) Challenges 1.Infer the right granularity XX Previous work: Fixed granularity
B C 37 Spam Haven Tier 1 Tier 2 D X BC K Coarse granularity A... DSLCORP A K Challenges 1.Infer the right granularity EECORP Idea: Infer granularity Medium granularity Well-managed network: fine granularity
38 Spam Haven Tier 1 Tier 2 DE BC W A... DSLSMTP Challenges 1.Infer the right granularity 2.We need online algorithms A fixed-memory device high-speed link X
Research Questions Given a sequence of labeled IP’s 1.Can we identify the specific regions on the Internet that have changed in malice? 2.Are there regions on the Internet that change their malicious activity more frequently than others? 39 Δ-Change Δ-Motion We Present
Background 1.IP Prefix trees 2.TrackIPTree Algorithm 40
41 Spam Haven Tier 1 Tier 2 DE BC W A... DSLCORP A X 220.127.116.11/32 18.104.22.168/24 IP Prefixes: i/d denotes all IP addresses i covered by first d bits IP Prefixes: i/d denotes all IP addresses i covered by first d bits Ex: 22.214.171.124-126.96.36.199 Ex: 1 host (all bits)
42 One Host Whole Net 0.0.0.0/0 0.0.0.0/1188.8.131.52/1 184.108.40.206/2192.0.0.0/2 0.0.0.0/2 220.127.116.11.0/ 2 An IP prefix tree is formed by masking each bit of an IP address. 0.0.0.0/318.104.22.168/32 0.0.0.0/31 22.214.171.124/3126.96.36.199/3 188.8.131.52/4184.108.40.206/4
43 0.0.0.0/0 0.0.0.0/1220.127.116.11/1 0.0.0.0/2 18.104.22.168.0/ 2 22.214.171.124/2192.0.0.0/2 A k-IPTree Classifier [VBSSS’09] is an IP tree with at most k-leaves, each leaf labeled with good (“+) or bad (“-”). 126.96.36.199/3188.8.131.52/3 184.108.40.206/4220.127.116.11/4 0.0.0.0/318.104.22.168/32 0.0.0.0/31 6- IPTree +- + - + + Ex: 22.214.171.124 is bad Ex: 126.96.36.199 is good
46 Goal: identify online the specific regions on the Internet that have changed in malice. /0 /1 /16 /17 /18 T 1 for epoch 1 + - + /0 /1 /16 /17 /18 T 2 for epoch 2 ++ - Δ-Bad: A change from good to bad Δ-Good: A change from bad to good Epoch 1 IP stream s 1 Epoch 2 IP stream s 2....
47 Goal: identify online the specific regions on the Internet that have changed in malice. /0 /1 /16 /17 /18 T 1 for epoch 1 + - + /0 /1 /16 /17 /18 T 2 for epoch 2 ++ - False positive: Misreporting that a change occurred False Negative: Missing a real change
48 Goal: identify online the specific regions on the Internet that have changed in malice. Idea: divide time into epochs and diff Use TrackIPTree on labeled IP stream s 1 to learn T 1 Use TrackIPTree on labeled IP stream s 2 to learn T 2 Diff T 1 and T 2 to find Δ-Good and Δ-Bad /0 /1 /16 /17 /18 T 1 for epoch 1 + - - /0 /1 /16 T 2 for epoch 2 - Different Granularities! ✗
49 Goal: identify online the specific regions on the Internet that have changed in malice. Δ-Change Algorithm Main Idea: Use classification errors between T i-1 and T i to infer Δ-Good and Δ-Bad
50 T i-2 T i-1 TiTi TrackIPTree S i-1 SiSi Fixed Ann. with class. error S i-1 T old,i-1 Ann. with class. error SiSi T old,i compare (weighted) classification error (note both based on same tree) Δ-Good and Δ-Bad Δ-Change Algorithm
Evaluation 1.What are the performance characteristics? 2.Are we better than previous work? 3.Do we find cool things? 55
56 Performance In our experiments, we : – let k=100,000 (k-IPTree size) – processed 30-35 million IPs (one day’s traffic) – using a 2.4 Ghz Processor Identified Δ-Good and Δ-Bad in <22 min using <3MB memory
57 2.5x as many changes on average! How do we compare to network-aware clusters? (By Prefix)
59 Botnets 22.1 and 28.6 thousand new DNSChanger bots appeared 38.6 thousand new Conficker and Sality bots
Caveats and Future Work “For any distribution on which an ML algorithm works well, there is another on which is works poorly.” – The “No Free Lunch” Theorem 60 Our algorithm is efficient and works well in practice.....but a very powerful adversary could fool it into having many false negatives. A formal characterization is future work. !
Detection Theory Base Rate, fallacies, and detection systems 61
62 Let Ω be the set of all possible events. For example: Audit records produced on a host Network packets seen Ω
63 Ω I Set of intrusion events I Intrusion Rate: Example: IDS Received 1,000,000 packets. 20 of them corresponded to an intrusion. The intrusion rate Pr[I] is: Pr[I] = 20/1,000,000 =.00002 Example: IDS Received 1,000,000 packets. 20 of them corresponded to an intrusion. The intrusion rate Pr[I] is: Pr[I] = 20/1,000,000 =.00002
64 Ω I A Set of alerts A Alert Rate: Defn: Sound
72 Ω IA Think of the Bayesian detection rate as the set of intrusions raising an alert normalized by the set of all alerts. (vs. detection rate which normalizes on intrusions.) Defn: Bayesian Detection rate Crux of IDS usefulness !
73 Ω IA Defn: Bayesian Detection rate Bayesian detection rate is the probability an alert signifies an intrusion. The crux of deciding whether a detection system is useful often comes down to this equation.
74 Ω IA 2 4 18 About 18% of all alerts are false positives!
Challenge We’re often given the detection rate and know the intrusion rate, and want to calculate the Bayesian detection rate – 99% accurate medical test – 99% accurate IDS – 99% accurate test for deception –... 75
Calculating Bayesian Detection Rate Fact: So to calculate the Bayesian detection rate: One way is to compute: 77
Example 1,000 people in the city 1 is a terrorists, and we have their pictures. Thus the base rate of terrorists is 1/1000 Suppose we have a new terrorist facial recognition system that is 99% accurate. – 99/100 times when someone is a terrorist there is an alarm – For every 100 good guys, the alarm only goes off once. An alarm went off. Is the suspect really a terrorist? 78 City (this times 10)
Example Answer: The facial recognition system is 99% accurate. That means there is only a 1% chance the guy is not the terrorist. 79 (this times 10) City Wrong!
Formalization 1 is terrorists, and we have their pictures. Thus the base rate of terrorists is 1/1000. P[T] = 0.001 99/100 times when someone is a terrorist there is an alarm. P[A|T] =.99 For every 100 good guys, the alarm only goes off once. P[A | not T] =.01 Want to know P[T|A] 80 City (this times 10)
1 is terrorists, and we have their pictures. Thus the base rate of terrorists is 1/1000. P[T] = 0.001 99/100 times when someone is a terrorist there is an alarm. P[A|T] =.99 For every 100 good guys, the alarm only goes off once. P[A | not T] =.01 Want to know P[T|A] 81 City (this times 10) Intuition: Given 999 good guys, we have 999*.01 ≈ 9-10 false alarms False alarms Guesses?
For IDS Let – I be an intrusion, A an alert from the IDS – 1,000,000 msgs per day processed – 2 attacks per day – 10 attacks per message 88 False positives True positives 70% detection requires FP < 1/100,000 80% detection generates 40% FP From Axelsson, RAID 99
Conclusion Firewalls – 3 types: Packet filtering, Stateful, and Application – Placement and DMZ IDS – Anomaly vs. policy-based detection Detection theory – Base rate fallacy 89