New Publication: A Tool for Enabling Scalable Automation in Security Control Selection
Another of our recent papers “” is now available online. In this work, we create a tool that enables scalable automation for control selection approaches. The tool is based on a previously proposed game-theoretic approach, but could be modified to support any other control selection approach. Scalability is achieved by the development of a novel algorithm that finds suggested security control combinations for a system while considering control dependencies and budgetary constraints. As the problem addressed by the algorithm is a variation of the bounded 0–1 knapsack problem with dependencies between items, we prove the functionality of the algorithm and demonstrate that it has computational complexity O(n) in special cases. This paper was presented at the . See Publications for more details!