Homework 1, Due Jan 22, 11am

1. Create an attack tree for stealing a car.
2. Create an attack tree for learning someone's online banking account name and password.
3. Create an attack tree for reading Alice's email (Alice uses GMail for her email).

For each attack tree exercise, you can present your attack tree as a figure (like in the lecture 2 slides), or you can present your attack tree as a list numbered in outline form (e.g., 1, 1.1, 1.2, 1.2.1, 1.2.2, 1.3, ...).

Your attack trees should be as complete as possible -- try not to overlook any branches. For each tree, you must have at least one path of height four or greater (where the height includes the root and the leaf). For each tree you must also have at least two nodes with four or more children.

Sometimes attack trees can be very deep, however, so in order to keep this problem tractable you can stop expanding on a path from the root after that path from the root contains five nodes (including the root and the leaf); just add a note saying that this node can be expanded further. (You can, of course, continue to expand your trees past a height of five if you desire. Also, it's OK if some paths from the root are shorter.)