Project description
This project involves modelling the defence of a network against a cyberattack using a combinatorial game on a graph - called an attack graph game. The underlying network is represented as a graph and attacks are represented by infected nodes spreading across the graph. We propose to implement a game-playing engine (in Python) and several strategies for defending and attacking. The strategy performance will be analysed in various scenarios, potentially using real-world network topologies. New and improved strategies will be derived from the observed results, with a focus on defending real-life networks. The project will mainly be coding, with an amount of mathematical/statistical analysis.
Co-supervisors
Michael Haythorpe (optional), Matthew Stephenson (optional)
Assumed knowledge
An amount of coding in Matlab, Python or similar. Undergraduate level mathematics and statistics.
Note: You need to register interest in projects from different supervisors (not a number of projects with the one supervisor).
You must also contact each supervisor directly to discuss both the project details and your suitability to undertake the project.