Scalable Algorithms for Identifying Stealthy Attackers in a Game‐Theoretic Framework Using Deception

DOI10.1002/9781119723950.CH3MaRDI QIDQ5075362zbMATH OpenOpenAlexFDO

Authors Anjon Basak, Charles A. Kamhoua, Sridhar Venkatesan, Marcus Gutierrez, Ahmed H. Anwar, Christopher Kiekintveld

Publication date 16 May 2022

Published in Game Theory and Machine Learning for Cyber Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/9781119723950.ch3

zbMATH Keywords

cybersecuritydeceptiongame theoryhoneypotmulti-agent systemsnetwork securitysimulation

Mathematics Subject Classification ID

Computer security (68M25) Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80)

Cited in

(8)

• Stealthy protocols: metrics and open problems
• Defending Against Opportunistic Criminals: New Game-Theoretic Frameworks and Algorithms
• Mitigating Covert Compromises
• Computing the Nash Equilibria of Intruder Classification Games
• scientific article; zbMATH DE number 7368358 (Why is no real title available?)
• Risk-Distortion Analysis for Video Collusion Attacks: A Mouse-and-Cat Game
• A game theoretical framework for inter-process adversarial intervention detection
• Shapley value to rank vulnerabilities on attack graphs: applications to cyberdeception

This page was built for publication: Scalable Algorithms for Identifying Stealthy Attackers in a Game‐Theoretic Framework Using Deception

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075362)