ForNet: A Distributed Forensic Network Kulesh Shanmugasundaram

Slides:



Advertisements
Similar presentations
Intrusion Detection Systems (I) CS 6262 Fall 02. Definitions Intrusion Intrusion A set of actions aimed to compromise the security goals, namely A set.
Advertisements

Top-Down Network Design Chapter Nine Developing Network Management Strategies Copyright 2010 Cisco Press & Priscilla Oppenheimer.
The Threat Within September Copyright © 2004 Q1 Labs. All Rights Reserved Agenda Customer Pain Industry Solutions Network Behavior Enforcement Example.
Module 5 - Switches CCNA 3 version 3.0 Cabrillo College.
CSCI 530 Lab Firewalls. Overview Firewalls Capabilities Limitations What are we limiting with a firewall? General Network Security Strategies Packet Filtering.
Hash-Based IP Traceback Best Student Paper ACM SIGCOMM’01.
Chapter 19: Network Management Business Data Communications, 4e.
1.  To analyze and explain the IDS placement in network topology  To explain the relationship between honey pots and IDS  To explain, analyze and evaluate.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
8.1 © 2007 by Prentice Hall 8 Chapter Securing Information Systems.
5/1/2006Sireesha/IDS1 Intrusion Detection Systems (A preliminary study) Sireesha Dasaraju CS526 - Advanced Internet Systems UCCS.
1 ITC242 – Introduction to Data Communications Week 12 Topic 18 Chapter 19 Network Management.
Payload Attribution via Hierarchical Bloom Filters
UNCLASSIFIED Secure Indirect Routing and An Autonomous Enterprise Intrusion Defense System Applied to Mobile ad hoc Networks J. Leland Langston, Raytheon.
Network Security. Network security starts from authenticating any user. Once authenticated, firewall enforces access policies such as what services are.
Chapter 2 Network Models.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
Firewalls and VPNS Team 9 Keith Elliot David Snyder Matthew While.
The OSI Model A layered framework for the design of network systems that allows communication across all types of computer systems regardless of their.
Lecture 11 Intrusion Detection (cont)
INTRUSION DETECTION SYSTEMS Tristan Walters Rayce West.
Security Guidelines and Management
Connecting LANs, Backbone Networks, and Virtual LANs
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
What is in Presentation What is IPsec Why is IPsec Important IPsec Protocols IPsec Architecture How to Implement IPsec in linux.
Hafez Barghouthi. Model for Network Access Security (our concern) Patrick BoursAuthentication Course 2007/20082.
CECS 5460 – Assignment 3 Stacey VanderHeiden Güney.
1 Kyung Hee University Prof. Choong Seon HONG Network Control.
1 The SpaceWire Internet Tunnel and the Advantages It Provides For Spacecraft Integration Stuart Mills, Steve Parkes Space Technology Centre University.
Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 8 – Denial of Service.
COEN 252 Computer Forensics
Common Devices Used In Computer Networks
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Connecting to the Network Networking for Home and Small Businesses.
Computers Are Your Future Tenth Edition Chapter 8: Networks: Communicating & Sharing Resources Copyright © 2009 Pearson Education, Inc. Publishing as Prentice.
CH2 System models.
Monitoring for network security and management Cyber Solutions Inc.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Identifying Application Impacts on Network Design Designing and Supporting Computer.
COEN 252 Computer Forensics Collecting Network-based Evidence.
Honeypot and Intrusion Detection System
Repeaters and Hubs Repeaters: simplest type of connectivity devices that regenerate a digital signal Operate in Physical layer Cannot improve or correct.
FIREWALLS Vivek Srinivasan. Contents Introduction Need for firewalls Different types of firewalls Conclusion.
Module 4: Configuring ISA Server as a Firewall. Overview Using ISA Server as a Firewall Examining Perimeter Networks and Templates Configuring System.
Chapter 6 – Connectivity Devices
Network and Perimeter Security Paula Kiernan Senior Consultant Ward Solutions.
Advanced Computer Networks Topic 2: Characterization of Distributed Systems.
1 Topic 2: Lesson 3 Intro to Firewalls Summary. 2 Basic questions What is a firewall? What is a firewall? What can a firewall do? What can a firewall.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 1: Introduction to Scaling Networks Scaling Networks.
CINBAD CERN/HP ProCurve Joint Project on Networking 26 May 2009 Ryszard Erazm Jurga - CERN Milosz Marian Hulboj - CERN.
Switch Features Most enterprise-capable switches have a number of features that make the switch attractive for large organizations. The following is a.
Internet Security and Firewall Design Chapter 32.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Prepared by Engr.Jawad Ali BSc(Hons)Computer Systems Engineering University of Engineering and Technology Peshawar.
NETWORKING FUNDAMENTALS. Network+ Guide to Networks, 4e2.
Digital Forensics Dr. Bhavani Thuraisingham The University of Texas at Dallas Network Forensics - III November 3, 2008.
DoS/DDoS attack and defense
Intrusion Detection System
Automated Worm Fingerprinting Authors: Sumeet Singh, Cristian Estan, George Varghese and Stefan Savage Publish: OSDI'04. Presenter: YanYan Wang.
Hyperion :High Volume Stream Archival Divya Muthukumaran.
Role Of Network IDS in Network Perimeter Defense.
Company LOGO Network Management Architecture By Dr. Shadi Masadeh 1.
Erik Jonsson School of Engineering and Computer Science The University of Texas at Dallas Cyber Security Research on Engineering Solutions Dr. Bhavani.
1 Netflow Collection and Aggregation in the AT&T Common Backbone Carsten Lund.
Firewalls. Overview of Firewalls As the name implies, a firewall acts to provide secured access between two networks A firewall may be implemented as.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
Network Processing Systems Design
CompTIA Security+ Study Guide (SY0-401)
Managing Secure Network Systems
Securing the Network Perimeter with ISA 2004
CHAPTER 3 Architectures for Distributed Systems
CompTIA Security+ Study Guide (SY0-401)
Presentation transcript:

ForNet: A Distributed Forensic Network Kulesh Shanmugasundaram

Security Fails….

What Mechanisms Do We Have? Logging mechanisms and audit trails Alerts/Logs from security components: Logs only perceived security threats Host Logs: First thing to get disabled upon intrusion An insider would rather use a host without any logs Mobility, wireless networks create new problems Packet Logs: Usually at the edges hence blinded easily Can’t keep data for long… E.g: Infinistream, NFR, NetWitness, SilentRunner

What do we need? A reliable mechanism for analysis and attribution An effective response model Current response model is mostly manual Response time is in days or weeks Digital evidence disappears quickly Tools that complement security components Need some safety net to fall back Forensics is that net

Challenges Facing Network Forensics Lack of Infrastructure: For data collection, archival, and dissemination Volume of Data: Prolonged storage, processing, and sharing of raw data infeasible Even a network of ~3000 hosts have a ~1TB/day requirement! Process is Manual: Spans multiple administrative domains Response times very long (digital evidence disappears) Unreliable Logging Mechanisms: Host logs are usually compromised Growing support for mobility makes it difficult to maintain prudent logging policies on hosts

Our Solution… Securely collect, store, disseminate, and process synopsis of network traffic. In other words a device analogous to a surveillance camera for the network. Even better – a co-operating network of such surveillance cameras. Goal of Project ForNet: development of tools, techniques, and infrastructure to aid rapid investigation and identification of cyber crimes

ForNet: A Unified, End-to-End Approach to Network Forensics SynApp: equipped routers or hosts. Primary function is to create synopses of network traffic. May have limited query processing and storage component as well. Forensic Server: Responsible for archiving synopses, query processing & routing, enforcing monitoring, security policies, for the domain. ForNet Domain: A domain covered by single monitoring and privacy policies.

Design Goals and Trade-Offs 1.“Complete” & “Correct” Evidence 2.Longevity 3.Succinctness 4.Accessibility of Evidence 5.Security & Privacy of Evidence 4.Ubiquity 5.Incremental Deployment 6.Modular 7.Scaleable Design

Research Challenges Networking, Distributed Systems Theory Systems Legal Issues Security High-speed packet capture Storage systems Databases GUI Legally admissible evidence Chain of custody Privacy Secure architecture Attacks on ForNet Use of ForNet Design of Synopses Quantitative Analysis Identification of events Architecture of ForNet Query Routing Fault Tolerance

Components of ForNet Architectural components can be grouped under following functions: 1. Data Collection 2. Data Retention 3. Data Dissemination SynApp Monitoring Policy Query Language Panorama Forensic Server Privacy Policy

Architecture of a SynApp Network Stream Network Filter Buffer Manager Synopsis Controller HBF Neoflow Histograms Synopsis Engine Synopses Sent To Forensic Server Configuration Manager Monitoring Policy Synopses Library

Synopses in ForNet Data Type LinkLink ContentMappingsAggregates Potentia l Evidenc e Protocol Layer IPs,ports, protocol TOS, TTL Packet packet sizes inter-arrival times Type of payload audio, video… IM Keywords Content MAC to IP DNS to IP VirtualHost to IP AS-Name to IP #Packets Delays etc. Synopse s Connection record Neoflow Header-dump Neoflow-NG * HBF Packet-dump MAC Records DNS Records HTTP Records * BGP Records * Histogram SCBF * * Currently being implemented

Architecture of Forensic Server Archive Manager Query Parser Privacy Manager Query Planner XML Generator HBF NeoflowDNS RecordsHistogramBGP Tables Configuration Manager Query From An Analyst Response To The Query Scan Detection Find ZombiesSteppingstones Security Manager

Forensic Server Forensic Server has the following functions: Data archiving Query processing Policy management and enforcement Data Archiving Periodically receives data from SynApps & archives them on disk.

Forensic Server (cont…) Query Processor: XML-based query language No relational databases (uses Berkeley DB) Does coalescence of synopses Given a query can locate appropriate synopses Generate and execute a query plan to answer the query Distributed query processing Currently being implemented to talk to nearby forensic servers to answer/corroborate queries/evidence Policy Enforcer: Two types of policies in ForNet: Monitoring Policy– informs user of what is being monitored Privacy Policy – informs user of how/with whom data is shared etc.

A user interface for: Building queries Data mining Visualization Architecture of Panorama Communication Manager XML Parser Plug-in Manager User Interface Manager Chart Generator Network Graphs 3D Link Maps Summary Views Data Cleansing Miners Queries, Various Commands to Forensic Server

Capturing Evidence on The Internet Internet is a gigantic state machine: To support forensics we need to know its precise state at any given time! Therefore, we need to keep track of state transitions State transitions can be characterized by: 1. Links/connections between nodes 2. Link content 3. Protocol mappings and aliases 4. Aggregates generated by state transitions Archiving raw traffic for this information is an overkill!

What is a Synopsis? Data structures and algorithms for representing a set of elements succinctly with predefined loss in information and has the ability to recall the original set of elements with a preset accuracy.

Properties of a Good Synopsis Contains enough data to answer certain classes of queries Who sent payload “xyz”? What did host bug.poly.edu send? Contains enough data to quantify confidence of its answers I’m 99.37% sure bug.poly.edu sent “XYZ” Have small memory footprint and easy to update Need 20GB/day to keep 1TB/day of raw network data Need to compute two hashes per packet Resource requirements are tunable Can only afford 3GB/day, adjust the accuracy to accommodate this.

Advantages of Using Synopses Succinct representation of raw data makes it possible to transfer network data to disks Sharing/transferring raw data over network is impossible but synopsis can be moved to remote sites Query processing would be expensive with raw data What’s the frequency of traffic to port 80 in the past week? (raw data vs. a histogram) Easily adaptable to various resource requirements Can adopt the size, processing requirements of a Bloom Filter based on various hardware resources and network load Can retain potential evidence for months! Allows for cascading different techniques!

Enterprise (100Mbps) Subnet (50Mbps) Edge (1Gbps) Core (40Gbps) CR-BF Topology maps SCBF Simple CR Topology maps Neoflow HBF DNS mappings Payload Sampling MAC-layer maps Cascading of Synopses

Packet Digests & Bloom Filters Snoeren et. al. used it successfully in SPIE for single packet traceback (“Hash-Based IP Traceback”) Space Efficient: 16-bits per packet (m/n=16) and 8 hashes (k=8) false positive (FP) = 5.74 x No false negatives! However, suppose we don’t have packets. We only have some excerpts of payload Don’t know where the excerpt was aligned in the packet Extend Bloom Filters to support excerpt/substring matching

Block-based Bloom Filter p0p0 p1p1 p2p2 ……p (n/s) P = create s-byte blocks of payload P = ( p 0 |0)( p 1 |s)( p 2 |2s) …… ( p (n/s) |n/s) append blocks’ Offset (in payload) Insert each block into a Bloom Filter P = s

BBF = ( p 0 |0)( p 1 |s)( p 2 |2s)( p 2 |3s) … ( p (n/s) |n/s) Q = s q0q0 q1q1 q2q2 ……q (l/s) Q = create s-byte blocks of query string Try all possible offsets ( q 0 |0) X ( q 0 |s) q 0 =p 1 ( q 1 |2s) q 1 =p 2 ( q 2 |3s) q 2 =p 3 “q 0 q 1 q 2” was seen in a payload at offset ‘s’ H 1 (q 0 |0)=1 H 2 (q 0 |0)=1 H 3 (q 0 |0)=0

P1 = ABRACA P2 = CDABRA For query strings: “AD”, “CB”, “DR”, “AA” etc. BBF falsely identifies them as seen in the payload! BBF = ( A |0)( B |s)( R |2s)( A |3s)( C |4s)( A |5s) ( C |0)( D |s)( A |2s)( B |3s)( R |4s)( A |5s) ( A |0)( B |s)( R |2s)( A |3s)( C |4s)( A |5s) ( C |0)( D |s)( A |2s)( B |3s)( R |4s)( A |5s) “Offset Collisions” Because BBF cannot distinguish between P1 and P2

Hierarchical Bloom Filter An HBF is basically a set of BBF for geometrically increasing sizes of blocks. ( p 0 |0)( p 1 |s)( p 2 |2s) …… ( p (n/s) |n/s) level-0 P = ( p 0 p 1 |0)( p 2 p 3 |2s)( p (n/s-1) p (n/s) |(n/s-1)) level-1 ( p 0 p 1 p 2 p 3 |0) level-2 Hierarchical Bloom Filter

Hierarchical Bloom Filter ( q 0 |0)( q 1 |s)( q 2 |2s)( q 3 |3s) … ( q (n/s) |l/s) level-0 Q = ( q 0 q 1 |0)( q 2 q 3 |2s)( q (l/s-1) q (l/s) |(l/s-1)) level-1 ( q 0 q 1 q 2 q 3 |0) level-2 Querying is similar to BBF. Matches at each level can be confirmed a level above.

Adapting an HBF for ForNet So far an HBF can attest for the presence of a bit-string in payloads We need to tie this bit-string to a source and/or destination hosts Our Approach: Similar to tying an offset to a block/bit-string In addition to inserting (block||offset) also insert (block||offset||hostid) Hostid could be (srcIP||dstIP)

Coalescence of Synopses HBF requires: Source IP, destination IP, excerpt But where do we get Source IP, Destination IP Connection Record/Neoflow Given two time intervals can give us list of source, destination IPs Coalesce these synopses Who sent “DEADBEEF” between time T1 and T2? Query Processor Connection record/Neoflow HBF Give all connections between time T1 and T2? Did (source, destination) IP send “DEADBEEF” between time T1 and T2? (source, destination) IPs of connections between time T1 and T2? YES/NO

ForNet in Intranet Usage Investigation based on payload characteristics Determine victims of worm, trojans and other malware. Detection of potential victims of phising and spyware Source of IP theft Investigation based on connection characteristics Detection of zombies Detection of malware based on connection pattern Investigation based on aggregate characteristics Insider abuse Network resource abuse Etc Etc …

ForNet Deployed on Internet Investigation based on payload characteristics Traceback based on partial content of single packets Source of malware, worms, etc. Investigation based on connection characteristics Stepping stone detection Investigation based on aggregate characteristics Attack attribution

Current Status Implemented a PC based SynApp device for placement within an intranet. Connection records, HBF, DNS, NewFlow, Mappings Implemented Forensics Server with simple querying capabilities. Current Forensic Server has 1.3TB of storage with over 3 months worth of data from the edge-router and two subnets Normal bandwidth consumption of network is about a 1 – 2 TB/day Synopses reduces this traffic to about 20GB/day A 4TB Forensic Server will take over operations in July Implemented Panorama (GUI Client)

Tracking MyDoom Recorded all traffic for a week Using HBF and raw traffic Was not aware of MyDoom during this collection When signatures became available we used them to query the system To find hosts that are infected in our network How the hosts were infected Some statistics: 679 hosts originated at least one copy of the virus 52 of which were in our network These hosts sent out copies of the virus to 2011 hosts outside our network boundary

Analyzing MyDoom Infections…

MyDoom’s Weekly Progress…

Neoflow-NG Keeps track of everything Neoflow has plus: Individual packet sizes Be able to recall the packet sizes in the same sequence Inter-arrival times of packets Be able to recall the arrival times of individual packets Content type of flow Be able to recall types of content carried by flows Audio, Video, Plain-Text, Encrypted, Compressed etc.

Investigating Network Resource Abuse

Total Network Bandwidth Composition

Detection of Network Proxies

Zombie Detection Are they any zombies in Poly network? And if so, how do we identify them? Criterion: Hosts that portscan and use IRC at likely zombies. Tabulate the amount of IRC activity for each host. Tabulate the amount of portscan activity for each host. For each host: ZOMBIE_LIKELIHOOD = PORTSCANS * IRC_FLOWS Sort all hosts by their ZOMBIE_LIKELIHOOD. List the top 200 hosts.

Work currently in progress… Identification of useful network events Network is the virtual crime scene that holds evidence in the form of network events Developing efficient synopses Handling connection oriented & connectionless traffic Techniques for payload attribution (esp. IRC/IM) Automatic cascading of various synopsis techniques Analysis and mining techniques Zombie detection Stepping stone detection

Work currently in progress… Integration of information from synopses across networks Development of a protocol for secure communication of various ForNet components Query processing and storage of synopses A query language transparent of various underlying synopsis techniques A query manage system to interpret the language for the underlying database Various storage and garbage collection strategies for collected-SynApps Storage and query processing infrastructure for Forensics Servers

Research Challenges Integration of information from synopses across networks Real power of ForNet is realized when information from SynApps is fused to answer queries Development of a protocol for secure communication of various ForNet components Query processing and storage of synopses A query language transparent of various underlying synopsis techniques A query management system to interpret the language for the underlying database Analysis A frame-work to compare effectiveness/trade-offs of synopses

Attacks on ForNet Resource Exhaustion: Flood the network with random bits of data Malicious Transformation: Create packets of length (blocksize – 1) Stuffing: Stuff every other block with application dependent escape characters For smaller blocks we can try to guess for larger blocks it is not possible! Exploiting Collisions: Hash collisions Very unlikely for strong hash functions We use a random seed for every HBF so it makes it more difficult Packet collisions A possibility in Block-based Bloom Filters but not in HBFs Streaming transformations: Encryption, compression

For more information visit: