Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan

Slides:



Advertisements
Similar presentations
Research Direction Introduction Advisor: Frank, Yeong-Sung Lin Presented by Hui-Yu, Chung.
Advertisements

A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Research Direction Introduction Advisor : Frank, Y.S. Lin Presented by Yu Pu Wu.
Worm Origin Identification Using Random Moonwalks Yinglian Xie, V. Sekar, D. A. Maltz, M. K. Reiter, Hui Zhang 2005 IEEE Symposium on Security and Privacy.
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
Analyzing Cooperative Containment Of Fast Scanning Worms Jayanthkumar Kannan Joint work with Lakshminarayanan Subramanian, Ion Stoica, Randy Katz.
Worm Defense. Outline  Internet Quarantine: Requirements for Containing Self-Propagating Code  Netbait: a Distributed Worm Detection Service  Midgard.
A General approach to MPLS Path Protection using Segments Ashish Gupta Ashish Gupta.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Game theoretic models for detecting network intrusions OPLab 1.
©2003–2008 Check Point Software Technologies Ltd. All rights reserved. CheckPoint new security architecture and R70 highlights.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Research Direction Introduction Advisor: Professor Frank, Y.S. Lin Presented by Chi-Hsiang Chan 2011/10/111.
Detection Unknown Worms Using Randomness Check Computer and Communication Security Lab. Dept. of Computer Science and Engineering KOREA University Hyundo.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
Logical Topology Design
Protection vs. false targets in series systems Reliability Engineering and System Safety(2009) Kjell Hausken, Gregory Levitin Advisor: Frank,Yeong-Sung.
DDoS Attack and Defense 郭承賓 (Allen C.B. Kuo). Autonomous System Entry node.
Research Direction Introduction Advisor: Professor Frank Y.S. Lin Present by Hubert J.W. Wang.
Redundancy and Defense Resource Allocation Algorithms to Assure Service Continuity against Natural Disasters and Intelligent Attackers Advisor: Professor.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Defender Message Strategies to Maximize Network Survivability for Multi-Stage Defense Resource.
Research Direction Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan 2010/10/211NTUIM OPLAB.
Research Direction Introduction Advisor: Professor Frank Y.S. Lin Present by Hubert J.W. Wang.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
SRS Kickoff Meeting, Arlington, VA, July 21, 2004
E FFECTIVE N ETWORK P LANNING AND D EFENDING S TRATEGIES TO M INIMIZE S ERVICE C OMPROMISED P ROBABILITY UNDER M ALICIOUS C OLLABORATIVE A TTACKS Advisor:
論文進度報告 Advisor: Professor Frank Y.S. Lin Presented by G.W. Chen 陳冠瑋.
Research Direction Introduction
Research Direction Introduction Advisor : Frank, Y.S. Lin Presented by Yu Pu Wu.
Research Direction Introduction Advisor: Frank, Yeong-Sung Lin Presented by Hui-Yu, Chung 2011/11/22.
Presented by Yu-Shun Wang Advisor: Frank, Yeong-Sung Lin Near Optimal Defense Strategies to Minimize Attackers’ Success Probabilities for networks of Honeypots.
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.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Advisor: Yeong-Sung Lin Presented by I-Ju Shih 2011/11/29 1 Research Direction Introduction.
Epidemic Profiles and Defense of Scale-Free Networks L. Briesemeister, P. Lincoln, P. Porras Presented by Meltem Yıldırım CmpE
RESERVOIR Service Manager NickTsouroulas Head of Open-Source Reference Implementations Unit Juan Cáceres
COmbining Probable TRAjectories — COPTRA
University of Maryland College Park
Constraint-Based Routing
A Study of Group-Tree Matching in Large Scale Group Communications
Intelligence Driven Defense, The Next Generation SOC
Author: Daniel Guija Alcaraz
Worm Origin Identification Using Random Moonwalks
Measuring Service in Multi-Class Networks
An Equal-Opportunity-Loss MPLS-Based Network Design Model
Research Progress Report
Frank Yeong-Sung Lin (林永松) Information Management Department
Optimization of Wireless Station Time Slot Allocation with Consideration of Throughput and Delay Constraints 指導教授:林永松 博士 研究生:林岦毅.
Presented by Hermes Y.H. Liu
Network Optimization Research Laboratory
Detecting Targeted Attacks Using Shadow Honeypots
Research Progress Report
Considering Multi-objective Resource Allocation Strategies under Attack-Defense Roles and Collaborative Attacks 考慮攻防雙角色與協同攻擊情況下之多目標資源分配策略 Advisor: Frank,Yeong-Sung.
Advisor: Professor Yeong-Sung Lin Student: Yeong-Cheng Tzeng (曾勇誠)
ECE453 – Introduction to Computer Networks
Department of Information Management National Taiwan University
Adviser: Frank,Yeong-Sung Lin Present by 瀅如
Research Progress Report
Advisor: Frank Yeong-Sung Lin, Ph.D. Presented by Yu-Jen Hsieh 謝友仁
Presented by Yu-Shun Wang
SURVIVABILITY IN IP-OVER-WDM NETWORKS (2)
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan
Research Direction Introduction
Introduction to Internet Worm
Presentation transcript:

Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan Efficient Network Planning and Defending Strategies to Minimize Attackers’ Success Probabilities under Malicious and Epidemic Attacks 考量惡意攻擊及傳染病攻擊下攻擊者成功機率最小化之有效網路規劃與防禦策略 Advisor: Frank,Yeong-Sung Lin Presented by Jia-Ling Pan 2019/5/16 NTUIM OPLAB

Agenda Problem Description Mathematical Formulation 2019/5/16 NTUIM OPLAB

Problem Description 2019/5/16 NTUIM OPLAB

Problem Description Attacker attributes Defender attributes Attack-defense scenarios 2019/5/16 NTUIM OPLAB

Attacker attributes Objective Using worms to get a clearer map of network topology information or vulnerability, and eventually compromise core nodes. 2019/5/16 NTUIM OPLAB

Attacker attributes Budget Preparing phase Attacking phase Worm purchasing v.s development Social engineering Attacking phase Node compromising Worm injection 2019/5/16 NTUIM OPLAB

Attacker attributes Preparing phase Worm attributes Social engineering Scanning method: blind v.s hitlist Propagation rate: static v.s dynamic Capability: basic v.s advanced Social engineering Number of edge nodes Number of hops from each core node to edge nodes 2019/5/16 NTUIM OPLAB

Attacker attributes Attacking phase Node compromising Worm injection Next hop selection criteria: Link degree High link degree ─ information seeking Link utilization Low link utilization ─ stealth strategy Worm injection Candidate selection criteria: Link traffic High link traffic ─ high rate worm Low link traffic ─ low rate worm Node defense resource β(t) Defense resource 2019/5/16 NTUIM OPLAB

Defender attributes Objective Budget Protect core nodes Planning phase Defending phase 2019/5/16 NTUIM OPLAB

Defender attributes Planning phase Defending phase Node protection General defense resources allocation(ex: Firewall, IDS) Decentralized information sharing system deployment Defending phase Decentralized information sharing system Unknown worm detection & signature distribution Rate limiting Worm origin identification Firewall reconfiguration Dynamic topology reconfiguration 2019/5/16 NTUIM OPLAB

Attack-defense scenarios 2019/5/16 NTUIM OPLAB

Scenarios O G D J I F C E A B H M AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm L 2019/5/16 NTUIM OPLAB

Scenarios Node compromise O G D J I F C E A B H M AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A Node compromise L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation O G D J I F C E A B H M AS node Core AS node Firewall Worm injection & propagation Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation O G D J I F C E A B H M AS node Core AS node Firewall Worm injection & propagation Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation Node compromise O G D J I F C E B H M AS node N Core AS node Firewall Worm injection & propagation Decentralized information sharing system Node compromise K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Node compromise Worm injection & propagation O G D J I F C E B H M AS node Node compromise N Core AS node Firewall Worm injection & propagation Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation Worm injection & propagation O D J I F C E A B H M AS node N Core AS node Worm injection & propagation Firewall Worm injection & propagation Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Signature generation& distribution Scenarios O Signature generation& distribution G D J I F C E A B H M AS node N Core AS node Worm injection & propagation Firewall Worm injection & propagation Decentralized information sharing system K Type1 worm Type2 worm Attacker A Detection alarm L Rate limiting 2019/5/16 NTUIM OPLAB

Firewall reconfiguration Scenarios O G D J I F C E A B H M Worm injection & propagation Firewall reconfiguration AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation O G D J I F C E A B H M AS node Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A L 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation O G D J I F C E A B H M AS node Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A Backdoor L 2019/5/16 NTUIM OPLAB

Signature generation& distribution Scenarios O Signature generation& distribution G D J I F C E A B H M Worm injection & propagation AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A Backdoor L Detection alarm 2019/5/16 NTUIM OPLAB

Scenarios Worm origin identification Worm origin identification J I F C E A B H M Worm injection & propagation AS node N Core AS node Firewall Decentralized information sharing system Worm origin identification K Type1 worm Type2 worm Attacker A Worm origin identification Backdoor L Firewall reconfiguration 2019/5/16 NTUIM OPLAB

Scenarios Worm injection & propagation Node compromise O G D J I F C E B H M Worm injection & propagation Node compromise AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A Backdoor L 2019/5/16 NTUIM OPLAB

dynamic topology reconfiguration Scenarios O G D J I F C E A B H M Worm injection & propagation AS node N Core AS node Firewall Decentralized information sharing system K Type1 worm Type2 worm Attacker A Backdoor L 2019/5/16 NTUIM OPLAB

Mathematical Formulation 2019/5/16 NTUIM OPLAB

Assumption 2019/5/16 NTUIM OPLAB

Assumption Defenders have complete information about the network, for example, topology, defense resource allocation, node attribute. There is a overlay network on network defender protected. Used to deploy decentralized information sharing system. Attackers have incomplete information about the network. 2019/5/16 NTUIM OPLAB

Given parameters N The index set of all nodes Q Notation Description N The index set of all nodes Q The index set of all nodes that had deployed decentralized information sharing system S The index set of all kinds of services αi The weight of ith service, where i∈S B The defender’s total budget E All possible defense configurations, including defense resources allocation and defending strategies An attack configuration, including attacker’s attributes, corresponding strategies and transition rules of the attacker launches jth attack on ith service, where i∈S, 1≤ j ≤ Fi 2019/5/16 NTUIM OPLAB

Given parameters Notation Description Z All possible attack configurations, including attacker’s attributes, corresponding strategies and transition rules Fi The total attacking times on ith service for all attackers, where i∈S 1 if the attacker can achieve his goal successfully, and 0 otherwise, where i∈S, 1≤ j ≤ Fi ni The general defense resources allocated to node i, where i∈N d The cost of constructing a decentralized information sharing system to one node g(qij) The cost of constructing a link from node i to node j with capacity qij, where i∈N, j∈N 2019/5/16 NTUIM OPLAB

Decision variables Notation Description An defense configuration, including defense resources allocation and defending strategies on ith service, i∈S xi 1 if node i is implemented with the decentralized information sharing system , and 0 otherwise, where i∈N qij The capacity of direct link between node i and j, where i∈N, j∈N 2019/5/16 NTUIM OPLAB

Objective function (IP 1) 2019/5/16 NTUIM OPLAB

Constraints Capacity constraint Integer constraint (IP 1.1) (IP 1.2) 2019/5/16 NTUIM OPLAB

Constraints Defender’s budget constraints (IP 1.5) 2019/5/16 NTUIM OPLAB

Constraints Defender’s budget constraints (IP 1.6) (IP 1.7) (IP 1.8) 2019/5/16 NTUIM OPLAB

Constraints QoS constraints QoS is a function of : Link utilization, core node loading, hops to core node, and affected traffic ratio. At the end of attack, the following constraint must be satisfied. (IP 1.9) 2019/5/16 NTUIM OPLAB

Constraints QoS Compromise times 2019/5/16 NTUIM OPLAB

Constraints QoS constraints The performance reduction cause by firewall reconfiguration should not make current status violate IP 1.9. The performance reduction cause by rate limiting should not make current status violate IP 1.9. The performance reduction cause by dynamic topology reconfiguration should not make current status violate IP 1.9. (IP 1.10) (IP 1.11) (IP 1.12) 2019/5/16 NTUIM OPLAB

Constraints QoS constraints The negative effect caused by false positive should not make current status violate IP 1.9. The defender has to guarantee at least one core node is not compromised at any time. (IP1.13) (IP1.14) 2019/5/16 NTUIM OPLAB

Constraints Signature generation and distribution constraints Only the nodes have deployed the decentralized information sharing system can be activated. Signature generation and distribution can only be activated after an unknown worm is detected. The signature generated by the system must achieve a confidence level so it can be distributed. The total cost for generating and distributing signatures can not exceed dynamic defense budget.(學長說要跟老師討論) (IP1.15) (IP1.16) (IP1.17) 2019/5/16 NTUIM OPLAB

Constraints Dynamic topology reconfiguration constraints For each core node, when ,defender can activate this mechanism so that core node can avoid being compromised or infected by worms. Only nodes that not yet been compromised can activate this mechanism. (IP1.18) (IP1.19) 2019/5/16 NTUIM OPLAB

Constraints Rate limiting constraints Path continuity constraint Only the nodes have deployed the decentralized information sharing system can enable rate limiting mechanism. Ai is the suspect traffic to node i, i∈N Path continuity constraint A node is only subject to attack if a path exists from attacker’s position to that node, and all the intermediate nodes on the path have been compromised. (IP1.20) (IP1.21) (IP1.22) 2019/5/16 NTUIM OPLAB

Thanks for your listening 2019/5/16 NTUIM OPLAB