Attacking Unexplored Networks - The Probe-and-Attack Problem

Attackers generally do not have complete information about the structure and function of a target network, and thus have to distribute resources between actions that directly achieve an objective to return some utility (‘Attack’), and actions that expose new knowledge about the network (‘Probe’) allowing new actions to be taken. We introduce the NP-hard two-action Probe-and-Attack Problem (PAP) and provide methods to compute upper and lower bounds on the optimal solution. We then compare the bounds to the performance of two greedy algorithms on specialized instances of the problem.

[1]  Marcin Dziubinski,et al.  Network Design and Defence , 2012, Games Econ. Behav..

[2]  Marco Di Summa,et al.  Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth , 2013, Discret. Appl. Math..

[3]  Osman Oguz,et al.  A fully polynomial approximation algorithm for the 0-1 knapsack problem , 1981 .

[4]  David Bruce Wilson,et al.  How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph , 1998, J. Algorithms.

[5]  Gerald G. Brown,et al.  Analyzing the Vulnerability of Critical Infrastructure to Attack and Planning Defenses , 2005 .

[6]  Stefan Bornholdt,et al.  Evolution of robust network topologies: Emergence of central backbones , 2012, Physical review letters.

[7]  N.C. Rowe,et al.  Thwarting Cyber-Attack Reconnaissance with Inconsistency and Deception , 2007, 2007 IEEE SMC Information Assurance and Security Workshop.

[8]  L. M. Giannini.  Optimum design of open pit mines , 1991, Bulletin of the Australian Mathematical Society.

[9]  Hans Kellerer,et al.  A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem , 1999, J. Comb. Optim..

[10]  Sushil Jajodia,et al.  Manipulating the attacker's view of a system's attack surface , 2014, 2014 IEEE Conference on Communications and Network Security.

[11]  Mario Ventresca,et al.  A Fast Greedy Algorithm for the Critical Node Detection Problem , 2014, COCOA.

[12]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[13]  Shlomo Havlin,et al.  Recent Progress on the Resilience of Complex Networks , 2015 .

[14]  Dorit S. Hochbaum,et al.  Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem , 2000, Oper. Res..

[15]  Gerald G. Brown,et al.  Solving Defender-Attacker-Defender Models for Infrastructure Defense , 2011, ICS 2011.

[16]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[17]  Thomas Erlebach,et al.  Network Discovery and Verification , 2005, WG.

[18]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[19]  Gerald G. Brown,et al.  Defending Critical Infrastructure , 2006, Interfaces.