Honeypot Allocation Games over Attack Graphs for Cyber Deception
| Autor: | Nandi O. Leslie, Ahmed H. Anwar, Christopher Kiekintveld, Charles A. Kamhoua |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Computer Science::Computer Science and Game Theory
Honeypot Sequential game Computer science media_common.quotation_subject ComputingMilieux_PERSONALCOMPUTING Game complexity Deception Computer security computer.software_genre Network topology symbols.namesake Nash equilibrium Scalability symbols Game theory computer Computer Science::Cryptography and Security media_common |
| Zdroj: | Game Theory and Machine Learning for Cyber Security |
| Popis: | In this chapter, we introduce a cyber deception defense approach and propose a scalable allocation algorithm to place honeypots over an attack graph. We formulate a two‐person zero‐sum strategic game between the network defender and an attacker. The developed game model captures the network topology and its characteristics. The game also counts for the cost associated with the defense action and the attack cost. Nash equilibrium defense strategies are analytically characterized and studied for a special game. The complexity of the general game is discussed and a scalable algorithm is proposed to overcome the game complexity. This chapter extends the model to a dynamic game formulation to better understand game evolution with players' actions. Finally, numerical results are presented to illustrate the effectiveness of the proposed cyber deception approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|