Homework 1, Due April 16, 6:30pm

1. Ferguson et al, Problem 1.1.
2. Ferguson et al, Problem 1.5.
3. Ferguson et al, Problem 1.8.
4. Not required, but highly encouraged for helping develop the "security mindset": walk through the process of doing a current event exercise as described in Section 1.12.1 of Ferguson et al.

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.)