This paper presents a relational approach for structuring security decision databases to support advanced automated functionalities. We represent attacks and countermeasures in a unifying environment using relational algebra. Both are viewed as actions that behave in opposite manners. We introduce an ordering that allows to rank security decisions according to their efficiency with respect a given attack. Furthermore, we prove that this ordering defines a lattice-structure that can serve to manage the decision database.
展开▼
