Metraipolis › archive › dc_ff2f75d33ccd

WLPA: A Network Management Framework for Allocating Scarce Quantum-Safe Link Postures under Weakest-Link Exposure — arXiv:2610.04897

Source: arXiv
Original: https://arxiv.org/abs/2610.04897
License (as archived): CC0-1.0
Archived: 2026-10-06T05:29:49.634Z
SHA-256 of the archived text: 0cd8efbc210095203e0f7cd71b4a568a63f5f9b3d9fcbb686c90b1518a0f9f22
Stable URL of this page: https://metraipolis.com/documento/dc_ff2f75d33ccd

How to cite

WLPA: A Network Management Framework for Allocating Scarce Quantum-Safe Link Postures under Weakest-Link Exposure — arXiv:2610.04897 — arXiv, https://arxiv.org/abs/2610.04897 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff2f75d33ccd (Metraipolis archive dc_ff2f75d33ccd, sha256 0cd8efbc210095203e0f7cd71b4a568a63f5f9b3d9fcbb686c90b1518a0f9f22)

BibTeX

@misc{dcff2f75d33ccd,
  title = {WLPA: A Network Management Framework for Allocating Scarce Quantum-Safe Link Postures under Weakest-Link Exposure — arXiv:2610.04897},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.04897},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff2f75d33ccd; sha256 0cd8efbc210095203e0f7cd71b4a568a63f5f9b3d9fcbb686c90b1518a0f9f22},
  year = {2026}
}

Archived text

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

Network operators migrating distributed systems to post-quantum and quantum-safe cryptography face a resource-management problem: quantum key distribution (QKD) gives the strongest guarantee available but is hardware-scarce and costly, so only a fraction of a deployment's links can receive it. Default practice -- ranking links by traffic or centrality and upgrading the top scorers -- optimizes each link in isolation, while a distributed job's real security is set by whichever active link ends up weakest. We present WLPA (Weakest-Link Posture Assignment), an implementation-ready decision framework and algorithm for allocating scarce quantum-safe postures under hardware, latency, and compliance constraints. WLPA computes the optimal weakest-link posture in closed form and returns an assignment in O(|E| log |E|) time -- 125 ms for a 20,000-link network on a laptop -- with a breach-aware refinement matching an exact integer program under common conditions. Our central contribution is a dichotomy telling operators exactly when existing per-link heuristics already match this optimum and when they systematically fail: under constant upgrade cost and uniform traffic-driven risk the two coincide exactly; once costs vary or an adversary concentrates on weak targets, heuristics leave the weakest link unprotected, unboundedly. We validate WLPA across 19 experiments: four microservice topologies, a real enterprise network (SNAP email-Eu-core), a post-quantum latency benchmark, a Qiskit BB84 simulation and a real-hardware BB84 run on IBM's ibm_marrakesh processor, checks against real production traffic traces, a CVE-calibrated correlated-compromise study, Bayesian uncertainty quantification, and seven baseline methods. A concrete-security reduction grounds the framework as theoretical foundation, not primary contribution.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.04897 — 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-06T05:26:35.347Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).