Solving zero-sum strategic games for dynamic honeypot allocation over attack graphs
Επίλυση παιχνιδιών μηδενικού αθροίσματος για δυναμική τοποθέτηση εργαλείων εντοπισμού παγίδευσης κάνοντας χρήση γράφων επιθέσεων
View/
Keywords
Honeypots ; Cybersecurity ; Attack graphs ; Dynamic allocation ; Cyber deception ; Game theoryAbstract
This thesis explores the strategic deployment of honeypots for enhancing cybersecurity
defenses through the lens of game theory. Beginning with an introduction to honeypots,
their significance, and various interaction levels, the study delves into fundamental
concepts of game theory, including self-interested agents, Nash equilibrium, and mixed
strategies. The research then progresses to propose a honeypot allocation modeling
framework, incorporating game theoretic principles and the Common Vulnerability
Scoring System (CVSS) including discussions on creating custom attack graph models,
rules, associations and also visualization techniques to enrich the understanding of the
proposed framework. Subsequently, optimal honeypot allocation strategies is
investigated through the formulation of zero-sum games, on the defender perspective.
A methodical approach to formulating payoff matrices and solving game models using
linear revised simplex methods is presented. Furthermore, an example demonstration
illustrates the practical application of the proposed framework in a 5 Host topology
scenario. In conclusion, this work underscores the importance of integrating game
theory into cybersecurity strategies.
Postgraduate Studies Programme
Ασφάλεια Ψηφιακών ΣυστημάτωνDepartment
Σχολή Τεχνολογιών Πληροφορικής και Επικοινωνιών. Τμήμα Ψηφιακών ΣυστημάτωνNumber of pages
75Language
EnglishCollections
Except where otherwise noted, this item's license is described as
Αναφορά Δημιουργού - Μη Εμπορική Χρήση - Παρόμοια Διανομή 3.0 Ελλάδα
Αναφορά Δημιουργού - Μη Εμπορική Χρήση - Παρόμοια Διανομή 3.0 Ελλάδα