A Learning-Based Approach to Reactive Security

By Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Song, Peter L. Bartlett. 2009

62 citations recorded by the source corpus.

Despite the conventional wisdom that proactive security is superior to reactive security, we show that reactive security can be competitive with proactive security as long as the reactive defender learns from past attacks instead of myopically overreacting to the last attack. Our game-theoretic model follows common practice in the security literature by making worst case assumptions about the attacker: we grant the attacker complete knowledge of the defender's strategy and do not require the attacker to act rationally. In this model, we bound the competitive ratio between a reactive defense algorithm (which is inspired by online learning theory) and the best fixed proactive defense. Additionally, we show that, unlike proactive defenses, this reactive strategy is robust to a lack of information about the attacker's incentives and knowledge.

Subfields: Computer Networks and Communications, Information Systems, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Battista Biggio
  2. Fabio Roli
  3. Giorgio Giacinto
  4. Giorgio Fumera
  5. Davide Maiorca
  6. Blaine Nelson
  7. Igino Corona
  8. Benjamin I. P. Rubinstein

In Information Systems

  1. Battista Biggio
  2. Fabio Roli
  3. Giorgio Fumera
  4. Giorgio Giacinto
  5. Davide Maiorca
  6. Blaine Nelson
  7. Igino Corona
  8. Benjamin I. P. Rubinstein

In Signal Processing

  1. Battista Biggio
  2. Fabio Roli
  3. Giorgio Giacinto
  4. Giorgio Fumera
  5. Davide Maiorca
  6. Igino Corona
  7. Blaine Nelson
  8. Nicholas Carlini

Citations in the corpus