pith. sign in

arxiv: 1906.09486 · v1 · pith:LB4T3UWWnew · submitted 2019-06-22 · 💻 cs.SI · cs.GT

Protecting shared information in networks: a network security game with strategic attacks

Bram de Witte , Paolo Frasca , Bastiaan Overvest , Judith Timmer This is my paper

Pith reviewed 2026-05-25 17:40 UTC · model grok-4.3

classification 💻 cs.SI cs.GT
keywords network securitygame theorystrategic attacksinformation sharingNash equilibriumsocial optimumunder-investmentover-investment
0
0 comments X

The pith

Strategic attacks on shared network information can lead to over-investment in security when dependencies are low, switching to under-investment as sharing rises.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models agents who share sensitive information tokens across a fixed network and choose how much to invest in security. It compares Nash equilibrium investments to the social optimum under two attack types. Random attacks always produce under-investment at equilibrium. Strategic attacks that target the least-protected agents produce over-investment when the network is sparse or sharing probabilities are low, and the pattern reverses to under-investment when sharing becomes more probable. The result shows that the direction of inefficiency depends on network topology and the intensity of information exchange.

Core claim

In a network where agents share tokens of sensitive information, Nash equilibrium security investments are always below the social optimum under random attacks. Under strategic attacks, investments exceed the social optimum when dependencies among agents are low because the information network is sparsely connected or because the probability that information tokens are shared is small; these over-investments pass on to under-investments when information sharing is more likely and therefore when the risk brought by the attack is higher.

What carries the argument

A security game on an information-sharing network in which each agent selects a protection level against either a random or a strategic adversary that chooses targets to maximize breach impact, with equilibria compared directly to the social planner's investment vector.

If this is right

  • Random attacks always produce equilibrium investments below the social optimum.
  • Strategic attacks produce over-investment precisely when agent dependencies are low.
  • The switch from over- to under-investment occurs as the probability of token sharing increases.
  • Network topology determines which investment pattern appears under strategic attacks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Regulators facing strategic threats may need different subsidy rules depending on observed sharing intensity.
  • Sparse contact networks could exhibit excess security spending that disappears once sharing becomes routine.
  • The model can be extended by allowing agents to choose both investment and whether to share at all.

Load-bearing premise

The network of contacts is fixed in advance and agents share information tokens according to fixed probabilities that do not change with protection choices.

What would settle it

Measure investment levels and breach outcomes in a small laboratory network where sharing probabilities and topology are controlled and the adversary is either random or strategic; check whether over-investment appears exactly when sharing probability is low and reverses when it rises.

Figures

Figures reproduced from arXiv: 1906.09486 by Bastiaan Overvest, Bram de Witte, Judith Timmer, Paolo Frasca.

Figure 1
Figure 1. Figure 1: The leftmost network is a complete network and the middle one is a ring network. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Several 3-regular networks. The complete network with 4 agents and the middle [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Computations on ring and complete graphs illustrate that the expected number of [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Security investments in a complete graph with [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Security investments in a ring graph with [PITH_FULL_IMAGE:figures/full_fig_p018_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Security investments in a star graph with [PITH_FULL_IMAGE:figures/full_fig_p019_6.png] view at source ↗
read the original abstract

A digital security breach, by which confidential information is leaked, does not only affect the agent whose system is infiltrated, but is also detrimental to other agents socially connected to the infiltrated system. Although it has been argued that these externalities create incentives to under-invest in security, this presumption is challenged by the possibility of strategic adversaries that attack the least protected agents. In this paper we study a new model of security games in which agents share tokens of sensitive information in a network of contacts. The agents have the opportunity to invest in security to protect against an attack that can be either strategically or randomly targeted. We show that, in the presence of random attack, under-investments always prevail at the Nash equilibrium in comparison with the social optimum. Instead, when the attack is strategic, either under-investments or over-investments are possible, depending on the network topology and on the characteristics of the process of the spreading of information. Actually, agents invest more in security than socially optimal when dependencies among agents are low (which can happen because the information network is sparsely connected or because the probability that information tokens are shared is small). These over-investments pass on to under-investments when information sharing is more likely (and therefore, when the risk brought by the attack is higher).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper models a network security game in which agents on a fixed contact network invest in security to protect probabilistically shared sensitive information tokens. An adversary attacks either uniformly at random or strategically by targeting the least-protected agent. The central claims are that random attacks always produce under-investment at Nash equilibrium relative to the social optimum, while strategic attacks can produce either over- or under-investment depending on network topology and the information-sharing probability; specifically, over-investment occurs when dependencies are low (sparse connectivity or low sharing probability) and switches to under-investment as sharing becomes more likely.

Significance. If the equilibrium characterizations hold, the result supplies a clean comparative-static distinction between random and strategic adversaries that reverses the standard positive-externality under-investment prediction precisely when the network is sparse or sharing is weak. This supplies a falsifiable topology-and-probability condition for over-investment that is absent from most existing network security games and could inform policy on information-sharing platforms.

minor comments (2)
  1. The abstract states equilibrium comparisons but supplies no payoff functions, equilibrium definitions, or proof sketches; the full manuscript should include these in §2 or §3 so that the under-/over-investment claims can be verified directly from the model equations.
  2. Notation for the sharing probability and the strategic-attack selection rule should be introduced once and used consistently; the current abstract phrasing (“the process of the spreading of information”) risks ambiguity with the contact network itself.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the paper and the recommendation for minor revision. The referee summary accurately captures the model, the distinction between random and strategic attacks, and the comparative-static results on under- versus over-investment as a function of network topology and information-sharing probability.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's derivation relies on standard definitions of Nash equilibrium and social optimum in a network game with externalities from shared information tokens. The distinction between random-attack under-investment (always) and strategic-attack outcomes (topology- and probability-dependent over- or under-investment) follows directly from comparing equilibrium investment levels to the planner's solution under the two attack regimes; no equation reduces to a fitted parameter renamed as prediction, no self-citation supplies a load-bearing uniqueness theorem, and no ansatz is smuggled via prior work. The model is self-contained against its stated assumptions of fixed contact network and probabilistic token sharing.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available, so free parameters, axioms, and invented entities cannot be enumerated. The model implicitly relies on standard assumptions of finite networks, probabilistic information sharing, and attacker knowledge of protection levels.

pith-pipeline@v0.9.0 · 5761 in / 1109 out tokens · 30182 ms · 2026-05-25T17:40:29.820582+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Acemoglu, A

    D. Acemoglu, A. Malekian, and A. Ozdaglar. Network security and contagion. Journal of Economic Theory, 166:536–585, 2016

    work page 2016

  2. [2]

    S. Amin, G. A. Schwartz, and S. S. Sastry. Security of interdependent and identical networked control systems. Automatica, 49(1):186–192, 2013. 19

    work page 2013

  3. [3]

    Anderson and T

    R. Anderson and T. Moore. The economics of information security. Science, 314(5799):610–613, 2006

    work page 2006

  4. [4]

    Bachrach, M

    Y. Bachrach, M. Draief, and S. Goyal. Contagion and observability in security domains. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1364–1371, Oct 2013

    work page 2013

  5. [5]

    R. B. Bapat and T. E. S. Raghavan. Nonnegative Matrices and Applications . Encyclo- pedia of Mathematics and its Applications. Cambridge University Press, 1997

    work page 1997

  6. [6]

    V. Bier, S. Oliveros, and L. Samuelson. Choosing what to protect: Strategic defensive allocation against an unknown attacker. Journal of Public Economic Theory , 9(4):563– 587, 2007

    work page 2007

  7. [7]

    H. Chan, M. Ceyko, and L.E. Ortiz. Interdependent defense games: Modeling in- terdependent security under deliberate attacks. In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence , UAI’12, pages 152–162, Arlington, Virginia, United States, 2012. AUAI Press

    work page 2012

  8. [8]

    G. Debreu. A social equilibrium existence theorem. Proceedings of the National Academy of Sciences, 38(10):886–893, 1952

    work page 1952

  9. [9]

    K. Fan. Fixed-point and minimax theorems in locally convex topological linear spaces. Proceedings of the National Academy of Sciences , 38(2):121–126, 1952

    work page 1952

  10. [10]

    Gale and H

    D. Gale and H. Nikaido. The Jacobian matrix and global univalence of mappings. Mathematische Annalen, 159(2):81–93, Apr 1965

    work page 1965

  11. [11]

    I. L. Glicksberg. A further generalization of the Kakutani fixed point theorem, with ap- plication to Nash equilibrium points. Proceedings of the American Mathematical Society, 3(1):170–174, 1952

    work page 1952

  12. [12]

    Gupta, C

    A. Gupta, C. Langbort, and T. Basar. Dynamic games with asymmetric information and resource constrained players with applications to security of cyberphysical systems. IEEE Transactions on Control of Network Systems , 4(1):71–81, March 2017

    work page 2017

  13. [13]

    He and H

    X. He and H. Dai. Dynamic Games for Network Security . Springer, 2018

    work page 2018

  14. [14]

    Heal and H

    G. Heal and H. Kunreuther. You only die once: Managing discrete interdependent risks. Working Paper 9885, National Bureau of Economic Research, August 2003

    work page 2003

  15. [15]

    Jang-Jaccard and S

    J. Jang-Jaccard and S. Nepal. A survey of emerging threats in cybersecurity. Journal of Computer and System Sciences , 80, 08 2014

    work page 2014

  16. [16]

    Johnson, J

    B. Johnson, J. Grossklags, N. Christin, and J. Chuang. Nash equilibria for weakest target security games with heterogeneous agents. In R. Jain and R. Kannan, editors, Game Theory for Networks , pages 444–458. Springer Berlin Heidelberg, 2012

    work page 2012

  17. [17]

    Laszka, M

    A. Laszka, M. Felegyhazi, and L. Buttyan. A survey of interdependent information security games. ACM Computing Surveys , 47(2):23:1–23:38, August 2014

    work page 2014

  18. [18]

    Lelarge and J

    M. Lelarge and J. Bolot. Economic incentives to increase security in the internet: The case for insurance. In IEEE INFOCOM, pages 1494–1502, April 2009

    work page 2009

  19. [19]

    M. Li, I. Koutsopoulos, and R. Poovendran. Optimal jamming attacks and network defense policies in wireless sensor networks. In IEEE INFOCOM , pages 1307–1315, 2007. 20

    work page 2007

  20. [20]

    Lou and Y

    J. Lou and Y. Vorobeychik. Equilibrium analysis of multi-defender security games. In Proceedings of the 24th International Conference on Artificial Intelligence , IJCAI’15, pages 596–602. AAAI Press, 2015

    work page 2015

  21. [21]

    M. H. Manshaei, Q. Zhu, T. Alpcan, T. Basar, and J.-P. Hubaux. Game theory meets network security and privacy. ACM Computing Surveys , 45(3):25:1–25:39, 2013

    work page 2013

  22. [22]

    H. Peters. Game Theory: A Multi-Leveled Approach . Springer Texts in Business and Economics. Springer Berlin Heidelberg, 2016

    work page 2016

  23. [23]

    H. R. Varian. Managing online security risks. New York Times, June 2000

    work page 2000

  24. [24]

    Y. Yuan, H. Yuan, L. Guo, H. Yang, and S. Sun. Resilient control of networked control system under DoS attacks: A unified game approach. IEEE Transactions on Industrial Informatics, 12(5):1786–1794, Oct 2016

    work page 2016

  25. [25]

    Zhu and T

    Q. Zhu and T. Basar. Game-theoretic methods for robustness, security, and resilience of cyberphysical control systems: Games-in-games principle for optimal cross-layer resilient control systems. IEEE Control Systems , 35(1):46–65, 2015

    work page 2015

  26. [26]

    Q. Zhu, H. Tembine, and T. Basar. Network security configurations: A nonzero-sum stochastic game approach. In Proceedings of the 2010 American Control Conference , pages 1059–1064, 2010. A Information dissemination on the complete graph We begin by proving1 formula (6). Proposition 6. Let Qn be the probability that any document reaches all nodes in Kn. The...

    work page 2010

  27. [27]

    We prove that there exists at least one pure strategy equilibrium

    work page

  28. [28]

    We prove that the equilibrium is unique and symmetric

    work page

  29. [29]

    Let us preliminary recall the reward of agent i, Πi = 1− ∑ j a∗ j(1− qj)Pij− 1 2 αq2 i , (30) and that the equilibrium solves ∂Πi ∂qi = 0

    We exhibit a symmetric equilibrium. Let us preliminary recall the reward of agent i, Πi = 1− ∑ j a∗ j(1− qj)Pij− 1 2 αq2 i , (30) and that the equilibrium solves ∂Πi ∂qi = 0. The derivative of (30) is given by ∂Πi ∂qi = a∗ i− ∑ j∈V ∂a∗ j ∂qi (1− qj)Pij− αqi (31) Step 1. We prove that Πi is quasi-concave in qi. The derivative of (31) is given by ∂2Πi ∂q2 i...

    work page