Metraipolis › archive › dc_bef53daf5457

Tractable Defense against Advanced Persistent Threats in Networked Settings — arXiv:2609.15614

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15614
License (as archived)
CC0-1.0
Archived
2026-10-15T23:54:07.444Z
SHA-256 of the archived text
8bf90db6110bfdb5d0eb09add156fd0cca86cb58edc94b80683863bb35290f0e
Stable URL of this page
https://metraipolis.com/documento/dc_bef53daf5457

How to cite

Tractable Defense against Advanced Persistent Threats in Networked Settings — arXiv:2609.15614 — arXiv (en), https://arxiv.org/abs/2609.15614 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bef53daf5457 (Metraipolis archive dc_bef53daf5457, sha256 8bf90db6110bfdb5d0eb09add156fd0cca86cb58edc94b80683863bb35290f0e)
BibTeX
@misc{dcbef53daf5457,
  title = {Tractable Defense against Advanced Persistent Threats in Networked Settings — arXiv:2609.15614},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15614},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bef53daf5457; sha256 8bf90db6110bfdb5d0eb09add156fd0cca86cb58edc94b80683863bb35290f0e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15614. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Recently, the theory of Boolean Dynamical Systems was proposed to study the decision theory surrounding the defense of computer networks against Advanced Persistent Threats (APTs). Boolean Dynamical Systems naturally capture four first principle primitives of APTs: the stealthy nature of attacks, limited and noisy information from automated systems like intrusion detection systems, lateral movement after the attacker penetrates into the network, and the defender's ability to secure a subset of computers at any time at the loss of resources such as system uptime. Currently, doing optimal/heuristic control in a computationally tractable manner is not possible because the emergent value function is computationally intractable (with respect to the network size). To resolve this, we propose a mean-field analysis inspired heuristic value function. We prove that our proposed heuristic is based on an exact computation of the value function under the assumption that the underlying state estimate distribution maximizes entropy. We numerically evaluate the quality of our heuristic as parameterized by the degree to which the entropy assumptions are violated.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-15 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.15614 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T23:20:42.713Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).