Metraipolis › archive › dc_5bb5e14cf3fb

A Matched Evaluation of QUBO Action Models and Defensive Remediation in Cyber Attack Graphs — arXiv:2611.02179

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02179
License (as archived)
CC0-1.0
Archived
2026-11-03T11:17:16.057Z
SHA-256 of the archived text
8be72640df0e11139e0e9a67d73219c1bc5f0b079e96bb6466751392d575ce28
Stable URL of this page
https://metraipolis.com/documento/dc_5bb5e14cf3fb

How to cite

A Matched Evaluation of QUBO Action Models and Defensive Remediation in Cyber Attack Graphs — arXiv:2611.02179 — arXiv (en), https://arxiv.org/abs/2611.02179 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5bb5e14cf3fb (Metraipolis archive dc_5bb5e14cf3fb, sha256 8be72640df0e11139e0e9a67d73219c1bc5f0b079e96bb6466751392d575ce28)
BibTeX
@misc{dc5bb5e14cf3fb,
  title = {A Matched Evaluation of QUBO Action Models and Defensive Remediation in Cyber Attack Graphs — arXiv:2611.02179},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02179},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5bb5e14cf3fb; sha256 8be72640df0e11139e0e9a67d73219c1bc5f0b079e96bb6466751392d575ce28},
  year = {2026}
}

Archived text

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

This study examines how vulnerability-specific actions affect quadratic unconstrained binary optimization (QUBO) models for minimum-cost cyber attack paths and defensive remediation. Edge-flow and variable-length hop formulations are evaluated using simulated annealing, steepest descent, and tabu search against exact classical references. Experiments on six independent synthetic topologies separate the effects of transition eligibility, vulnerability labels, exploit costs, and multiple exploit alternatives. A single labeled action per eligible transition preserves feasible paths, optimal costs, and QUBO size. Under the tested settings, multiple exploit alternatives were associated with approximately unchanged valid-path recovery, lower optimal-path recovery, and substantially larger representations, particularly for the hop formulation. These recovery differences remain descriptive because they are not statistically significant after correction for multiple comparisons. An evaluation on a published 3CX attack graph with synthetic costs demonstrates applicability beyond the generated topologies. The defensive extension selects patches within a budget to raise attack-path costs to specified thresholds or disconnect protected targets. Against exhaustive and mixed-integer references, the tested QUBO heuristics recovered an optimal patch set in 12 of 16 calls across eight scenarios on one topology. The results characterize formulation correctness, solution recovery, and resource requirements using classical local optimization, without establishing quantum computational advantage.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2611.02179 — 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-11-03T11:02:07.221Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).