Moving Target Defense under Uncertainty for Web Applications
暂无分享,去创建一个
[1] Sailik Sengupta,et al. Multi-agent Reinforcement Learning in Bayesian Stackelberg Markov Games for Adaptive Moving Target Defense , 2020, ArXiv.
[2] Hooman Alavizadeh,et al. Toward Proactive, Adaptive Defense: A Survey on Moving Target Defense , 2019, IEEE Communications Surveys & Tutorials.
[3] Wei Hu,et al. Moving target defense: state of the art and characteristics , 2016, Frontiers of Information Technology & Electronic Engineering.
[4] Nicholas R. Jennings,et al. Playing Repeated Security Games with No Prior Knowledge , 2016, AAMAS.
[5] Gergely Neu,et al. Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits , 2015, J. Mach. Learn. Res..
[6] Zhisheng Hu,et al. Reinforcement Learning Algorithms for Adaptive Cyber Defense against Heartbleed , 2014, MTD '14.
[7] Ehab Al-Shaer,et al. Random Host Mutation for Moving Target Defense , 2012, SecureComm.
[8] Ambuj Tewari,et al. Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret , 2012, ICML.
[9] Michael B. Crouse,et al. Improving the Diversity Defense of Genetic Algorithm-Based Moving Target Approaches , 2012 .
[10] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[11] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[12] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .