An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California.

Slides:



Advertisements
Similar presentations
Incident Response Managing Security at Microsoft Published: April 2004.
Advertisements

1 Intrusion Monitoring of Malicious Routing Behavior Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of Computer Science UCDavis.
Code-Red : a case study on the spread and victims of an Internet worm David Moore, Colleen Shannon, Jeffery Brown Jonghyun Kim.
October 31st, 2003ACM SSRS'03 Tolerating Denial-of-Service Attacks Using Overlay Networks – Impact of Topology Ju Wang 1, Linyuan Lu 2 and Andrew A. Chien.
The Case for Enterprise Ready Virtual Private Clouds Timothy Wood, Alexandre Gerber *, K.K. Ramakrishnan *, Jacobus van der Merwe *, and Prashant Shenoy.
This work was supported by the TRUST Center (NSF award number CCF ) 1. Setting up experiment on DETER testbed a)Created twelve pc backbone nodes.
I would like to thank Louis P. Wilder and Dr. Joseph Trien for the opportunity to work on this project and for their continued support. The Research Alliance.
1 Chapter 7 Intrusion Detection. 2 Objectives In this chapter, you will: Understand intrusion detection benefits and problems Learn about network intrusion.
4.1.5 System Management Background What is in System Management Resource control and scheduling Booting, reconfiguration, defining limits for resource.
® Context Aware Firewall Policies Ravi Sahita Priya Rajagopal, Pankaj Parmar Intel Corp. June 8 th 2004 IEEE Policy (Security)
The Evolving Threat of Internet Worms Jose Nazario, Arbor Networks.
Network Isolation Using Group Policy and IPSec Paula Kiernan Senior Consultant Ward Solutions.
INDEX  Ethical Hacking Terminology.  What is Ethical hacking?  Who are Ethical hacker?  How many types of hackers?  White Hats (Ethical hackers)
1 Telstra in Confidence Managing Security for our Mobile Technology.
S5-1 © 2001 Carnegie Mellon University OCTAVE SM Process 5 Identify Key Components Software Engineering Institute Carnegie Mellon University Pittsburgh,
© 2008 Prentice Hall Business Publishing Accounting Information Systems, 11/e Romney/Steinbart1 of 222 C HAPTER 7 Information Systems Controls for Systems.
The Phoenix Recovery System: Rebuilding from the ashes of an Internet catastrophe Flavio Junqueira, Ranjita Bhagwan, Keith Marzullo, Stefan Savage, and.
An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.
1 GENI: Global Environment for Network Innovations Jennifer Rexford Princeton University
T H E O H I O S T A T E U N I V E R S I T Y Computer Science and Engineering 1 Wenjun Gu, Xiaole Bai, Sriram Chellappan and Dong Xuan Presented by Wenjun.
Internet Quarantine: Requirements for Containing Self-Propagating Code David Moore et. al. University of California, San Diego.
An Overview Zhang Fu Outline What is DDoS ? How it can be done? Different types of DDoS attacks. Reactive VS Proactive Defence.
Greenbench: A Benchmark for Observing Power Grid Vulnerability Under Data-Centric Threats Mingkui Wei, Wenye Wang Department of Electrical and Computer.
Security Risk Management Marcus Murray, CISSP, MVP (Security) Senior Security Advisor, Truesec
Norman SecureSurf Protect your users when surfing the Internet.
1 Security Risk Analysis of Computer Networks: Techniques and Challenges Anoop Singhal Computer Security Division National Institute of Standards and Technology.
1 Worm Modeling and Defense Cliff C. Zou, Don Towsley, Weibo Gong Univ. Massachusetts, Amherst.
Denial of Service A Brief Overview. Denial of Service Significance of DoS in Internet Security Low-Rate DoS Attacks – Timing and detection – Defense High-Rate,
NICE :Network Intrusion Detection and Countermeasure Selection in Virtual Network Systems.
Stamping out worms and other Internet pests Miguel Castro Microsoft Research.
Speaker:Chiang Hong-Ren Botnet Detection by Monitoring Group Activities in DNS Traffic.
University of California, San Diego Computer Science and Engineering Concurrent Systems Architecture Group Agile Objects: Component-based Inherent Survivability.
Michael Ernst, page 1 Collaborative Learning for Security and Repair in Application Communities Performers: MIT and Determina Michael Ernst MIT Computer.
On the Scale and Performance of Cooperative Web Proxy Caching University of Washington Alec Wolman, Geoff Voelker, Nitin Sharma, Neal Cardwell, Anna Karlin,
Honeypot and Intrusion Detection System
Computer Science Open Research Questions Adversary models –Define/Formalize adversary models Need to incorporate characteristics of new technologies and.
Source-End Defense System against DDoS attacks Fu-Yuan Lee, Shiuhpyng Shieh, Jui-Ting Shieh and Sheng Hsuan Wang Distributed System and Network Security.
Resisting Denial-of-Service Attacks Using Overlay Networks Ju Wang Advisor: Andrew A. Chien Department of Computer Science and Engineering, University.
INTERNATIONAL NETWORKS At Indiana University Hans Addleman TransPAC Engineer, International Networks University Information Technology Services Indiana.
(CISCO) Self-Defending Networks Ben Sangster. Agenda (CISCO) Self-Defending Network Concept Why do we need SDN’s? Foundation of the CSDN? Endpoint Protection.
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.
The UCSD Network Telescope A Real-time Monitoring System for Tracking Internet Attacks Stefan Savage David Moore, Geoff Voelker, and Colleen Shannon Department.
Stamping out worms and other Internet pests Miguel Castro Microsoft Research.
University of California, San Diego Computer Science and Engineering Concurrent Systems Architecture Group Agile Objects: Component-based Inherent Survivability.
Microsoft ISA Server 2000 Presented by Ricardo Diaz Ryan Fansa.
Surviving Internet Catastrophes Flavio Junqueira, Alejandro Hevia, Ranjita Bhagwan, Keith Marzullo, and Geoffrey M. Voelker Hot Topics in Operating Systems.
Company LOGO User Authentication Threat Modelling from User and Social Perspective “Defending the Weakest Link: Intrusion.
Sample Presentation Headline REPRESENTATIVE SUBHEAD TO SUPPORT SUBJECT Presenter’s Name Presenter’s Title Presentation Date DeterLab A Tool for Cybersecurity.
Mobile Code and Worms By Mitun Sinha Pandurang Kamat 04/16/2003.
Jacques Bus Head of Unit, DG INFSO-F5 “Security” European Commission FP7 launch in the New Member States Regional on-line conference 22 January 2007 Objective.
Supplemental Information on TOR (The Onion Router) CEH ed 8, Rev 4 CS3695 – Network Vulnerability Assessment & Risk Mitigation–
SRS Kickoff Meeting, Arlington, VA, July 21, 2004
University of California, San Diego Computer Science and Engineering Concurrent Systems Architecture Group Agile Objects: Component-based Inherent Survivability.
Paul Beraud, Alen Cruz, Suzanne Hassell, Juan Sandoval, Jeffrey J Wiley November 15 th, 2010 CRW’ : NETWORK MANEUVER COMMANDER – Resilient Cyber.
RobuSTore: Performance Isolation for Distributed Storage and Parallel Disk Arrays Justin Burke, Huaxia Xia, and Andrew A. Chien Department of Computer.
TRUST Self-Organizing Systems Emin G ü n Sirer, Cornell University.
2016/3/13 1 Peer-to-peer system-based active worm attacks: Modeling, analysis and defense Wei Yu, Sriram Chellappan, Xun Wang, Dong Xuan Computer Communications.
1 Welcome to Designing a Microsoft Windows 2000 Network Infrastructure.
1 A Blueprint for Introducing Disruptive Technology into the Internet Larry Peterson Princeton University / Intel Research.
Unit 2 Personal Cyber Security and Social Engineering Part 2.
MicroGrid Update & A Synthetic Grid Resource Generator Xin Liu, Yang-suk Kee, Andrew Chien Department of Computer Science and Engineering Center for Networked.
Kevin Watson and Ammar Ammar IT Asset Visibility.
Internet Quarantine: Requirements for Containing Self-Propagating Code
MadeCR: Correlation-based Malware Detection for Cognitive Radio
Threats to computers Andrew Cormack UKERNA.
Adaptable safety and security in v2x systems
Determined Human Adversaries: Mitigations
11/17/2018 9:32 PM © Microsoft Corporation. All rights reserved. MICROSOFT MAKES NO WARRANTIES, EXPRESS, IMPLIED OR STATUTORY, AS TO THE INFORMATION IN.
Determined Human Adversaries: Mitigations
Introduction to Internet Worm
Presentation transcript:

An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California San Diego Overlay Network for Location-Hiding Summary Communication infrastructure to allow applications to communicate with users without disclosing IP addresses Protect applications from direct attacks Problems Can proxy networks achieve location-hiding? If so, under what circumstances? (feasibility) How long will it take attackers to reveal application location? (metrics) How do properties of defense & proxy networks affect location-hiding? (parametric) –Resource recovery –Proxy network reconfiguration –Correlated host vulnerability Generic Framework for Location-Hiding Resource Pool Application Proxy Network User Attacker Proxy Network Layered View User Edge Proxy Proxy Resource Pool (IP Network) Host Proxy Network Application Attacker Overlay Proxy Network Top View Attack Model Proxies: software components run on hosts Proxies adjacent: iff IP addresses mutually known Proxy Network Topology: adjacency structure Depth: min distance (hops) from edge proxies to app Edge proxies publish their IP addresses Users access applications via edge proxies Goal: reveal application location (IP address) Compromise hosts and reveal (expose) location of adjacent proxies Penetrate proxy network using exposed location information Defense Model Goal: recover compromised hosts, invalidate information attackers have Resource recovery –Recover compromised hosts –Reactive recovery: detection-triggered –Proactive reset: periodic reload/security patch Proxy network reconfiguration –Invalidate information attackers have –e.g. proxy migration Compromised Exposed Intact Proxy state transition Hosts w/ similar configurations grouped as domain –High correlation inside domain –Low correlation across domains e.g. define domain by OS platforms Correlated Vulnerability Compromised Intact Host state transition attack defense Feasibility of Location-Hiding No reconfiguration Log scale Linear scale This work is supported in part by the National Science Foundation under awards NSF EIA Grads and NSF Cooperative Agreement ANI (OptIPuter), NSF CCR (VGrADS), NSF NGS , and NSF Research Infrastructure Grant EIA Support from Hewlett-Packard, BigBangwidth, Microsoft, and Intel is also gratefully acknowledged. Application Legitimate User Proxy Network Attacker where? Stochastic Model * Data shown in examples are inferred from Microsoft Security Bulletin critical vulnerability data, worm propagation speed, Lippmann et al Intrusion detection systems evaluation results, and our prototype proxy network evaluation results. Uncorrelated Vulnerability Theorem I Without proxy network reconfiguration, the expected time to application exposure T  dT where T is the expected time to compromise a host, d is proxy network depth. Theorem II Consider a proxy network with random proxy migration rate  r (  r  2 ), the expected time to application exposure T grows exponentially with the proxy network depth d; specifically  T . Theorem I Without proxy network reconfiguration, the expected time to application exposure T  dT where T is the expected time to compromise a host, d is proxy network depth. Theorem II Consider a proxy network with random proxy migration rate  r (  r  2 ), the expected time to application exposure T grows exponentially with the proxy network depth d; specifically  T . Location-Hiding Infeasible w/o Sufficient Reconfiguration Location-Hiding Feasible with Sufficient Reconfiguration Parametric Study migration has qualitative impact migration rate + proxy network depth  exponential improvement resource recovery limited impact Correlated Vulnerability Correlated host vulnerabilities can make location-hiding infeasible All hosts share similar vulnerabilities (single domain). Even with high migration rates, can’t achieve location-hiding. v the dominant attack rate, is much here than migration rate. Exploiting limited host diversity & intelligent proxy placement achieves location-hiding Interleave proxies on different domains Proxies migrate inside domain Design of a generic framework and analytic model for proxy network approaches to location-hiding Using analytic modeling and simulation techniques, we characterize key properties of proxy network and find - Existing approaches employing static structure are vulnerable to host compromise attacks - Adding proactive defenses employing proxy network reconfiguration and migration makes location-hiding feasible, proxy network depth & reconfiguration rates are critical factors - Correlated host vulnerability can make location-hiding infeasible - By exploiting limited host diversity and intelligent construction of proxy network, negative impact of correlation can be mitigated and location-hiding can be achieved Work in Progress Impact of overlay topology in location-hiding (SSRS’03) -Using a similar model, we characterize favorable and unfavorable topologies for location-hiding from a graph theoretic perspective -Found high connectivity, a merit in other context, may undermine location-hiding -Popular overlays, e.g. Chord, are unfavorable for location-hiding; low-dimensional CAN and binary de Bruijn graphs are favorable. Proxy Network DoS Resilience (empirical study) -Simulation testbed: large scale Internet simulator (MicroGrid) -Proxy network working prototype -Real DDoS attack tool (Trinoo) and real application (Apache) -Study impact of attack and effectiveness of proxy network (impact of proxy deployment as well)