English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study a Stackelberg game between an attacker and a defender on largeActive Directory (AD) attack graphs where the defender employs a set ofhoneypots to stop the attacker from reaching high-value targets. Contrary toexisting works that focus on small and static attack graphs, AD graphstypically contain hundreds of thousands of nodes and edges and constantlychange over time. We consider two types of attackers: a simple attacker whocannot observe honeypots and a competent attacker who can. To jointly solve thegame, we propose a mixed-integer programming (MIP) formulation. We observedthat the optimal blocking plan for static graphs performs poorly in dynamicgraphs. To solve the dynamic graph problem, we re-design the mixed-integerprogramming formulation by combining m MIP (dyMIP(m)) instances to produce anear-optimal blocking plan. Furthermore, to handle a large number of dynamicgraph instances, we use a clustering algorithm to efficiently find the m-mostrepresentative graph instances for a constant m (dyMIP(m)). We prove a lowerbound on the optimal blocking strategy for dynamic graphs and show that ourdyMIP(m) algorithms produce close to optimal results for a range of AD graphsunder realistic conditions.

Catch Me if You Can: Effective Honeypot Placement in Dynamic AD Attack Graphs