Academic Journals Database
Disseminating quality controlled scientific knowledge

Game Theory Based Network Security

ADD TO MY LIST
 
Author(s): Yi Luo | Ferenc Szidarovszky | Youssif Al-Nashif | Salim Hariri

Journal: Journal of Information Security
ISSN 2153-1234

Volume: 01;
Issue: 01;
Start page: 41;
Date: 2010;
Original page

Keywords: Multi-Stage Attack | Dynamic Game | Multi-Objective Optimization | Adaptive Learning

ABSTRACT
The interactions between attackers and network administrator are modeled as a non-cooperative non-zero-sum dynamic game with incomplete information, which considers the uncertainty and the special properties of multi-stage attacks. The model is a Fictitious Play approach along a special game tree when the attacker is the leader and the administrator is the follower. Multi-objective optimization methodology is used to predict the attacker’s best actions at each decision node. The administrator also keeps tracking the attacker’s actions and updates his knowledge on the attacker’s behavior and objectives after each detected attack, and uses it to update the prediction of the attacker’s future actions. Instead of searching the entire game tree, appropriate time horizons are dynamically determined to reduce the size of the game tree, leading to a new, fast, adaptive learning algorithm. Numerical experiments show that our algorithm has a significant reduction in the damage of the network and it is also more efficient than other existing algorithms.

Tango Jona
Tangokurs Rapperswil-Jona

     Save time & money - Smart Internet Solutions