Solve the following questions a

will create attack trees for different attacker goals to help you

systematically think through various attacks. You can represent your

attack tree graphically, or as a numbered list $($e$.$g$.,1,1\mathrm{.}1,1\mathrm{.}2,1\mathrm{.}2\mathrm{.}1,$

$1\mathrm{.}3,$dots.

QUESTIONS

Create an attack tree for getting into a gym without paying. Which attack do you think is most

likely? Assign a probability value $($e$.$g$.,$ "high," "low," or $"30\%")$ to each node.

Create an attack tree for reading someone else's email. Assign a difficulty level to each attack

node $($e$.$g$.,$ "easy," "hard," "very hard"$).$ Which attack requires the least sophistication on the

part of the attacker? Which attack requires the greatest expertise? What types of attackers do

you think would use either attack?

Create an attack tree for learning someone's online banking account name and password.

Assign Riyal values to each attack node. Which attack is cheapest for the attacker? Which attack

is most expensive?

Important: minimum requirement for each attack tree:

Has at least three different attacks $($second$-$level nodes$)$

Has at least one attack with a path at least three subnodes deep

Has at least two attacks that have subtasks with at least two immediate children

Answers all questions and justifies rankings and answers. E$.$g$.,"$We think that attack

would be the

easiest because

whereas

would not be as easy because