paper-with-me

Papers

Moving Target Defense for Web Applications using Bayesian Stackelberg Games

2016-02-23 · Sailik Sengupta, Satya Gautam Vadlamudi, Subbarao Kambhampati, Marthony Taguinod, Adam Doupé, Ziming Zhao, Gail-Joon Ahn

The present complexity in designing web applications makes software security a difficult goal to achieve. An attacker can explore a deployed service on the web and attack at his/her own leisure. Moving Target Defense (MTD) in web applications is an effective mechanism to nullify this advantage of their reconnaissance but the framework demands a good switching strategy when switching between multiple configurations for its web-stack. To address this issue, we propose modeling of a real-world MTD web application as a repeated Bayesian game. We then formulate an optimization problem that generates an effective switching strategy while considering the cost of switching between different web-stack configurations. To incorporate this model into a developed MTD system, we develop an automated system for generating attack sets of Common Vulnerabilities and Exposures (CVEs) for input attacker types with predefined capabilities. Our framework obtains realistic reward values for the players (defenders and attackers) in this game by using security domain expertise on CVEs obtained from the National Vulnerability Database (NVD). We also address the issue of prioritizing vulnerabilities that when fixed, improves the security of the MTD system. Lastly, we demonstrate the robustness of our proposed model by evaluating its performance when there is uncertainty about input attacker information.

📄 PDF Abstract BibTeX arXiv:1602.07024

Code (1)

sailik1991/StackelbergEquilibribumSolvers 공식 구현

Similar Papers 제목 키워드 기반

Multi-agent Reinforcement Learning in Bayesian Stackelberg Markov Games for Adaptive Moving Target Defense

2020-07-20 · Sailik Sengupta, Subbarao Kambhampati

The field of cybersecurity has mostly been a cat-and-mouse game with the discovery of new attacks leading the way. To take away an attacker's advantage of reconnaissance, researchers have proposed proactive defense metho…

Multi-agent Reinforcement LearningQ-LearningReinforcement Learning (RL)

Learning Movement Strategies for Moving Target Defense

2021-01-01 · Sailik Sengupta, Subbarao Kambhampati

The field of cybersecurity has mostly been a cat-and-mouse game with the discovery of new attacks leading the way. To take away an attacker's advantage of reconnaissance, researchers have proposed proactive defense metho…

Q-Learning

EI-MTD:Moving Target Defense for Edge Intelligence against Adversarial Attacks

2020-09-19 · Ya-guan Qian, Qiqi Shao, Jia-min Wang, Xiang Lin 외

With the boom of edge intelligence, its vulnerability to adversarial attacks becomes an urgent problem. The so-called adversarial example can fool a deep learning model on the edge node to misclassify. Due to the propert…

Knowledge DistillationScheduling

MTDeep: Boosting the Security of Deep Neural Nets Against Adversarial Attacks with Moving Target Defense

2017-05-19 · Sailik Sengupta, Tathagata Chakraborti, Subbarao Kambhampati

Present attack methods can make state-of-the-art classification systems based on deep neural networks misclassify every adversarially modified test example. The design of general defense strategies against a wide range o…

ClassificationGeneral Classification

Meta Stackelberg Game: Robust Federated Learning against Adaptive and Mixed Poisoning Attacks

2024-10-22 · Tao Li, Henger Li, Yunian Pan, Tianyi Xu 외

Federated learning (FL) is susceptible to a range of security threats. Although various defense mechanisms have been proposed, they are typically non-adaptive and tailored to specific types of attacks, leaving them insuf…

Federated LearningMeta-LearningModel PoisoningReinforcement Learning (RL)