Minimal Schedule with Minimal Number of Agents in Attack-Defence Trees

01/18/2021
by   Jaime Arias, et al.
0

Expressing attack-defence trees in a multi-agent setting allows for studying a new aspect of security scenarios, namely how the number of agents and their task assignment impact the performance, e.g. attack time, of strategies executed by opposing coalitions. Optimal scheduling of agents' actions, a non-trivial problem, is thus vital. We discuss associated caveats and propose an algorithm that synthesises such an assignment, targeting minimal attack time and using minimal number of agents for a given attack-defence tree.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

06/12/2019

Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-Agent Systems

Attack-Defence Trees (ADTs) are well-suited to assess possible attacks t...
11/09/2021

Attack time analysis in dynamic attack trees via integer linear programming

Attack trees are an important tool in security analysis, and an importan...
06/30/2020

Robust Multi-Agent Task Assignment in Failure-Prone and Adversarial Environments

The problem of assigning agents to tasks is a central computational chal...
09/12/2017

Enemy At the Gateways: A Game Theoretic Approach to Proxy Distribution

A core technique used by popular proxy-based circumvention systems like ...
12/27/2018

Attribute Evaluation on Attack Trees with Incomplete Information

Attack trees are considered a useful tool for security modelling because...
05/20/2015

On Minimal Change in Evolving Multi-Context Systems (Preliminary Report)

Managed Multi-Context Systems (mMCSs) provide a general framework for in...
10/06/2021

A Novel Approach for Attack Tree to Attack Graph Transformation: Extended Version

Attack trees and attack graphs are both common graphical threat models u...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.