TY - GEN
T1 - The Risk of Attacker Behavioral Learning
T2 - 13th International Conference on Decision and Game Theory for Security, GameSec 2022
AU - Nguyen, Thanh Hong
AU - Yadav, Amulya
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - In security games, the defender often has to predict the attacker’s behavior based on some observed attack data. However, a clever attacker can intentionally change its behavior to mislead the defender’s learning, leading to an ineffective defense strategy. This paper investigates the attacker’s imitative behavior deception under uncertainty, in which the attacker mimics a (deceptive) behavior model by consistently playing according to that model, given that it is uncertain about the defender’s learning outcome. We have three main contributions. First, we introduce a new maximin-based algorithm to compute a robust attacker deception decision. Second, we propose a new counter-deception algorithm to tackle the attacker’s deception. We show that there is a universal optimal defense solution, regardless of any private knowledge the defender has about the relation between his learning outcome and the attacker deception choice. Third, we conduct extensive experiments, demonstrating the effectiveness of our proposed algorithms.
AB - In security games, the defender often has to predict the attacker’s behavior based on some observed attack data. However, a clever attacker can intentionally change its behavior to mislead the defender’s learning, leading to an ineffective defense strategy. This paper investigates the attacker’s imitative behavior deception under uncertainty, in which the attacker mimics a (deceptive) behavior model by consistently playing according to that model, given that it is uncertain about the defender’s learning outcome. We have three main contributions. First, we introduce a new maximin-based algorithm to compute a robust attacker deception decision. Second, we propose a new counter-deception algorithm to tackle the attacker’s deception. We show that there is a universal optimal defense solution, regardless of any private knowledge the defender has about the relation between his learning outcome and the attacker deception choice. Third, we conduct extensive experiments, demonstrating the effectiveness of our proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85151147019&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85151147019&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-26369-9_1
DO - 10.1007/978-3-031-26369-9_1
M3 - Conference contribution
AN - SCOPUS:85151147019
SN - 9783031263682
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 3
EP - 22
BT - Decision and Game Theory for Security - 13th International Conference, GameSec 2022, Proceedings
A2 - Fang, Fei
A2 - Xu, Haifeng
A2 - Hayel, Yezekael
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 26 October 2022 through 28 October 2022
ER -