arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.08994cs.CRcs.AIcs.GT

Constraints Satisfiability Driven Reinforcement Learning for Autonomous Cyber Defense

University of North Carolina Charlotte(北卡罗来纳大学夏洛特分校);Carnegie Mellon University(卡内基梅隆大学);Pacific Northwest National Laboratory(太平洋西北国家实验室)

Ashutosh Dutta, Ehab Al-Shaer, Samrat Chatterjee

英文摘要:

With the increasing system complexity and attack sophistication, the necessity of autonomous cyber defense becomes vivid for cyber and cyber-physical systems (CPSs). Many existing frameworks in the current state-of-the-art either rely on static models with unrealistic assumptions, or fail to satisfy the system safety and security requirements. In this paper, we present a new hybrid autonomous agent architecture that aims to optimize and verify defense policies of reinforcement learning (RL) by incorporating constraints verification (using satisfiability modulo theory (SMT)) into the agent's decision loop. The incorporation of SMT does not only ensure the satisfiability of safety and security requirements, but also provides constant feedback to steer the RL decision-making toward safe and effective actions. This approach is critically needed for CPSs that exhibit high risk due to safety or security violations. Our evaluation of the presented approach in a simulated CPS environment shows that the agent learns the optimal policy fast and defeats diversified attack strategies in 99\% cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑