14 citations · 17 across the 10 of their papers we have counts for
10 papers
CS-Guard: Benchmarking LLM Guardrails for Code Generation Security
Jinyang Li, Mingyu Guo, Hung X. Nguyen
Large language models (LLMs) have been ex- ploited to generate malware, but the effective- ness of guardrails for code generation secu- rity remains unclear. We introduce CS-Guard,…
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Jialiang Li, Aneta Neumann, Frank Neumann +2
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algor…
Adaptive Wizard for Removing Cross-Tier Misconfigurations in Active Directory
Huy Q. Ngo, Mingyu Guo, Hung Nguyen
Security vulnerabilities in Windows Active Directory (AD) systems are typically modeled using an attack graph and hardening AD systems involves an iterative workflow: security team…
Optimizing Cyber Response Time on Temporal Active Directory Networks Using Decoys
Huy Q. Ngo, Mingyu Guo, Hung Nguyen
Microsoft Active Directory (AD) is the default security management system for Window domain network. We study the problem of placing decoys in AD network to detect potential attack…
Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs
Huy Quang Ngo, Mingyu Guo, Hung Nguyen
We study a Stackelberg game between an attacker and a defender on large Active Directory (AD) attack graphs where the defender employs a set of honeypots to stop the attacker from…
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems
Diksha Goel, Aneta Neumann, Frank Neumann +2
We study a Stackelberg game between one attacker and one defender in a configurable environment. The defender picks a specific environment configuration. The attacker observes the…
Limited Query Graph Connectivity Test
Mingyu Guo, Jialiang Li, Aneta Neumann +2
We propose a combinatorial optimisation model called Limited Query Graph Connectivity Test. We consider a graph whose edges have two possible states (On/Off). The edges' states are…
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Max Ward, Aneta Neumann +2
Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…
Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation
Diksha Goel, Max Ward, Aneta Neumann +3
Active Directory (AD) is the default security management system for Windows domain networks. We study a Stackelberg game model between one attacker and one defender on an AD attack…
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
Mingyu Guo, Jialiang Li, Aneta Neumann +2
Active Directory is the default security management system for Windows domain networks. We study the shortest path edge interdiction problem for defending Active Directory style at…