Pith. sign in

REVIEW 4 major objections 4 minor 19 references

Routing and Wavelength Assignment with Minimal Attack Radius for QKD Networks

T0 review · 4 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper introduces maxNAR, a metric for the worst-case impact of a single physical-layer jamming attack on a QKD network, and a routing heuristic that minimizes it.

desk verdict Useful new metric and heuristic for QKD attack resilience, but the ILP as written is not linear and the optimality claim needs a fix. read the letter →

arxiv 2508.10613 v1 pith:Y4WJ3LSZ submitted 2025-08-14 quant-ph cs.NI

Mengyao Li , Qiaolun Zhang , Zongshuai Yang , Stefano Bregni , Alberto Gatto , Raouf Boutaba , Massimo Tornatore This is my paper · ORCID
classification quant-phcs.NI MSC 81P9490C1090C59
keywords quantumkeydistributionnetworkresiliencephysical-layerattackmaxNARroutingandwavelengthassignmenttrustedrelayopticalbypasstabusearch
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Quantum key distribution (QKD) networks can exchange keys with information-theoretic security, but a single high-power jamming attack on one fiber can disrupt many key requests at once, especially when optical bypass lets interference propagate downstream. This paper defines maxNAR, the Maximum Number of Affected Requests under the worst single-link attack, and uses it to formulate a new problem: routing, wavelength, and key-rate assignment that minimizes maxNAR over time slots. The authors solve the problem exactly with an integer linear program for small networks and with a scalable tabu-search heuristic for larger ones. On a five-node ring, the heuristic matches the ILP optimum (maxNAR = 2 for trusted-relay and hybrid architectures) in seconds rather than hours; on a 14-node topology it reduces maxNAR by about 27% versus a shortest-path baseline. A tunable parameter lets operators trade off between optical bypass (low module cost, larger attack radius) and trusted relays (more modules, smaller radius).

What carries the argument

The central object is the maxNAR metric together with the attack-propagation model it encodes: a jamming attack on a physical link disrupts every request sharing that link, and for optical-bypass (OB) paths the attack signal propagates through the bypass to all downstream links in the same direction, while trusted-relay (TR) paths terminate the propagation and QKP-cached keys are unaffected. The RWA-MAR problem turns this metric into an optimization: minimize the sum over timeslots of maxNAR, subject to flow conservation, module counts, channel capacity, and key-rate/QKP storage constraints. The Min-maxNAR heuristic is a tabu-search algorithm that starts from a shortest-path solution (with a

What would settle it

A controlled experiment on a deployed QKD testbed: inject a high-power jamming signal into one link of a path using optical bypass and measure which key requests actually fail; if requests beyond the first bypassed node survive because the jamming signal drops below the damage threshold, maxNAR is not a faithful worst-case count. Alternatively, compute maxNAR on a topology where OB paths share only a single upstream link; if the model predicts large downstream disruption but observed outages are confined to the directly jammed link, the propagation assumption is falsified.

Watch

Extended reading notes

Core claim

The central claim is that the worst-case security exposure of a QKD network to a physical-layer attack can be captured by a single number, maxNAR, and that this number can be substantially reduced by routing choices that exploit key caching, trusted relays, and optical bypass. The attack-propagation model behind maxNAR treats a jammed link as disrupting every request traversing it; for optical-bypass paths the interference propagates to all downstream links in the same direction, while trusted-relay paths stop at the relay and QKP-cached keys are completely immune. The paper supports this claim by formulating the RWA-MAR problem as an ILP, showing the heuristic matches the ILP where the ILP

Load-bearing premise

The paper treats a high-power jamming attack on one fiber as disrupting every request that shares the fiber, with the disruption propagating unchanged through every downstream link when the path uses optical bypass; if real jamming signals attenuate, spread differently, or fail to propagate through certain hardware, maxNAR may overstate or understate the true worst case.

Editorial extensions

If this is right

  • Network operators could quantify a QKD deployment's security exposure by a single worst-case number, maxNAR, and compare architectures (OB, TR, hybrid) on that basis.
  • Key caching in QKPs can be exploited by routing to sharply reduce maxNAR over timeslots; the paper shows maxNAR dropping from 37 to 32 in the first timeslot and stabilizing near 1–2 once pools are stocked.
  • A tunable OB/TR preference parameter spans the resource–security trade-off: higher TR preference cuts maxNAR substantially (23% between α=80 and α=0 in the hybrid architecture) at the cost of more QKD modules.
  • The tabu-search heuristic is fast enough for operational use—about five seconds versus over ten hours for the ILP on the small testbed—and scales to network sizes where the ILP is infeasible.
  • The approach adapts the classical lightpath attack radius idea from all-optical WDM networks to QKD-specific features like key pools, trusted relays, and optical bypass.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If maxNAR is adopted as a planning metric, the same attack-propagation model could be applied to classical encrypted optical networks that use regenerators or optical bypass, not just QKD.
  • The paper's attack model assumes a single link is jammed; a natural extension is a worst-case over multiple simultaneous jammers, which would turn the min-max problem into a min-max over attack sets and likely require different combinatorial tools.
  • The heuristic's performance depends on the assumption that the jamming signal propagates deterministically through optical bypass; a field measurement of jamming attenuation over multiple bypassed nodes would calibrate whether maxNAR should be weighted by distance or signal power rather than counting requests uniformly.
  • QKP capacity is sized against AES-256 key rotation; if QKD keys were used for one-time-pad encryption of large traffic, the QKP buffer would be a scarcer resource and the routing trade-offs in this paper would shift.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper introduces a new metric, maxNAR (Maximum Number of Affected Requests), to quantify the worst-case impact of a single physical-layer jamming attack in QKD networks. It formulates the Routing and Wavelength Assignment with Minimal Attack Radius (RWA-MAR) problem as an ILP, proposes a Tabu-search heuristic (Min-maxNAR), and evaluates the approach on a 5-node ring (PoliQi) and the 14-node NSF topology under three architectures: Optical Bypass (OB), Trusted Relay (TR), and their combination (OB-TR). The paper reports that the heuristic achieves the same optimal maxNAR as the ILP on the small ring, reduces maxNAR by about 27% over a depth-first shortest-path baseline on NSF, and analyzes the effect of a tunable priority parameter α and QKP caching across time slots.

Significance. If the technical issues are resolved, the paper addresses a relevant and under-explored problem: resilience of QKD networks to physical-layer attacks. The proposed maxNAR metric, the explicit modeling of OB/TR differences, and the use of QKP caching are useful contributions. The paper also builds on realistic QKD key-rate models from prior work. The main value would be in providing a network-design metric and heuristic algorithms for attack-aware routing. However, in its current form, the ILP formulation and the statistical support for the headline claims need correction before the results can be trusted.

major comments (4)
  1. [Section II-D, Eqs. (3) and (15)] Eq. (3) defines f_{e,w}^{p,t} = q_{e,w}^{p,t} ∨ p_{e,w}^{p,t}, and Eq. (15) defines C_{φ}^{d,t} ≥ (xx_{e'}^{d,t} · h_{φ,e'}) ∧ B_{φ}^{t}. Neither is a linear inequality, and no linearization (e.g., big-M) is provided. As written, the model is not an ILP. This is load-bearing because the claim that the Min-maxNAR heuristic 'achieves the same (optimal) maxNAR of the ILP' in Section III is the main evidence for correctness. Please provide the linearized constraints explicitly, or state that a solver's indicator/logical-constraint handling is used and justify that the model remains a valid ILP. Without this, the optimality result is not reproducible from the stated model.
  2. [Section II-A vs. Eq. (16)] The definition of maxNAR in Section II-A says it is 'the maximum number of requests any one request is link-sharing with,' which is a pairwise property between requests. However, Eq. (16) defines maxNAR^t as a lower bound on the number of requests affected by an attack on a route/link, maximized over e and φ. These are different objects. The text and the equations must be aligned; otherwise the metric being minimized is ambiguous. This is central because all security claims are stated in terms of maxNAR.
  3. [Section III, Figs. 4-6] The heuristic is randomized (Tabu search with random lightpath selection), but the results in Figs. 4-6 show no error bars, confidence intervals, or statistical tests. The conclusion that the heuristic 'significantly outperforms the baseline' is not supported by a single run of a stochastic algorithm. Please report multiple independent runs (or seed sensitivity) and provide statistical comparisons. Also, for the PoliQi case, give the ILP solver's optimality gap/time-limit information so the exact-optimality claim can be assessed.
  4. [Section I and Section II-A] The attack-propagation model assumes that a high-power jamming signal on one link propagates through OB to downstream links, and that QKP-cached keys are completely immune. These assumptions are load-bearing for the validity of maxNAR as a security metric, but the paper does not validate them experimentally or with a sensitivity analysis. If the physical model is inaccurate, the optimized routing may not improve true resilience. Please add a discussion of the physical basis, cite relevant experimental work, and/or include sensitivity tests of the propagation assumptions.
minor comments (4)
  1. [Section II-D, Eq. (10)] The quantifier in Eq. (10) reads '∀p∈E_a', but p should be a node pair, not an auxiliary link; it should likely be '∀p∈P'.
  2. [Table II] The variable z_{p,w}^t is described as 'equals t' if the QKD path uses channel w; this should be 'equals 1'.
  3. [Section III] There is a typo 'Fig. ref fig:14-2(a)' in the α-discussion; it should be a proper figure reference.
  4. [General] Several spacing and capitalization inconsistencies appear: 'RW A-MAR' in the abstract, 'maXNAR' in the contribution list. These should be corrected.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular dependency: maxNAR is defined and then optimized, heuristic is evaluated against the same objective, and input parameters are taken from prior work rather than fitted to outcomes.

full rationale

The paper's central derivation chain is not circular. The metric maxNAR is defined in Section II-A ("maxNAR as the maximum number of requests any one request is link-sharing with") and then used as the objective in the ILP (Eq. 1: min sum of maxNAR^t) and in the heuristic (Algorithm 1 updates maxNAR). Evaluating a heuristic against the objective it optimizes is standard practice, not circularity: no parameter is fitted to make the reported maxNAR reduction happen. The tunable parameter alpha (Section II-E) controls the initial preference for OB or TR paths and is varied in Fig. 5 to show trade-offs; it is not fitted to the test instances. Key-rate values (Table I) and QKP capacity are adopted from Refs. [5] and [15], which are prior works by overlapping authors, but these are inputs to the model, not results derived from the present claim. The heuristic's comparison against the depth-first shortest-path baseline is an external benchmark, and the PoliQi comparison against the ILP is an independent (if formally problematic) benchmark. The notable flaw is that the stated 'ILP' is not actually linear as written: Eq. (3) uses a logical OR and Eq. (15) uses a logical AND with no linearization. This is a correctness/reproducibility concern, not circularity, because it does not make the outcome equivalent to the input by construction. Overall, the self-citations are present but not load-bearing, so the circularity score is low.

Assumptions & free parameters 1 free parameters · 4 assumptions · 1 invented entities

The central optimization depends on the attack-propagation model (OB), the QKP immunity assumption, and the key-rate inputs from prior work. The only free parameter in the reported method is the α preference knob; the metric maxNAR itself is an invented definition without external validation, which is appropriate for a new performance indicator but must be validated against physical-layer models.

free parameters (1)
  • Priority parameter α = 0 and 80 in experiments (tunable)
    Controls initial path selection between Optical Bypass and Trusted Relay in the heuristic (Section II-E, Fig. 5). It is a user-set knob, not fitted to external data, but it directly drives the reported maxNAR improvements.
assumptions (4)
  • domain assumption High-power jamming attack on a physical link affects all requests sharing that link and propagates through Optical Bypass to downstream links.
    Motivated in Section I, Fig. 1, and used to define maxNAR in Section II-A. This attack-propagation model is the foundation of the metric; if over- or under-estimated, the optimization targets a distorted quantity.
  • domain assumption Keys cached in Quantum Key Pools are completely unaffected by physical-layer attacks.
    Stated in Section II-A ('keys distributed via QKP are always unaffected by physical-layer attacks'). This removes QKP paths from NAR computation, shaping the objective.
  • domain assumption Achievable key rates for different reaches follow the model of Ref [5] (Table I), decreasing by 11% per crossed node under OB.
    Used as input in simulations in Section III; the results depend on these rates, which are not derived in this paper.
  • domain assumption Network is directional and link-sharing is defined as traversing the same physical link in the same direction.
    Given in Section II-A; the directional definition affects which attacks are considered.
invented entities (1)
  • maxNAR metric
    purpose: Quantify the worst-case number of key requests disrupted by a single physical-layer attack on a QKD network.
    Introduced and defined in this paper (Section II-A). It is a definition, not an empirical entity; no external data validate that it captures real attack impact, and the paper's own simulation uses it as both target and evaluation metric.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Routing and Wavelength Assignment with Minimal Attack Radius for QKD Networks." pith.science (2026). https://pith.science/paper/Y4WJ3LSZ

@misc{pith2026250810613,
  author       = {Pith},
  title        = {Pith review of: Routing and Wavelength Assignment with Minimal Attack Radius for QKD Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Y4WJ3LSZ}},
  note         = {Machine review of arXiv:2508.10613}
}
read the original abstract

Quantum Key Distribution (QKD) can distribute keys with guaranteed security but remains susceptible to key exchange interruption due to physical-layer threats, such as high-power jamming attacks. To address this challenge, we first introduce a novel metric, namely Maximum Number of Affected Requests (maxNAR), to quantify the worst-case impact of a single physical-layer attack, and then we investigate a new problem of Routing and Wavelength Assignment with Minimal Attack Radius (RWA-MAR). We formulate the problem using an Integer Linear Programming (ILP) model and propose a scalable heuristic to efficiently minimize maxNAR. Our approach incorporates key caching through Quantum Key Pools (QKPs) to enhance resilience and optimize resource utilization. Moreover, we model the impact of different QKD network architectures, employing Optical Bypass (OB) for optical switching of quantum channels and Trusted Relay (TR) for secure key forwarding. Moreover, a tunable parameter is designed in the heuristic to guide the preference for OB or TR, offering enhanced adaptability and dynamic control in diverse network scenarios. Simulation results confirm that our method significantly outperforms the baseline in terms of security and scalability.

Figures

Figures reproduced from arXiv: 2508.10613 by the authors.

Figure 1
Figure 1. Example of QKD-specific technologies A. Related work QKD networks have been successfully demonstrated in testbeds in various countries, including Switzerland and Italy [1], demonstrating their potential for secure communication. The feasibility of co-existence between QKD and conven￾tional communication signals in optical fiber networks has also been validated [11]. A QKD network architecture is commonly organized i… view at source ↗
Figure 2
Figure 2. Example of NAR calculation channel between two adjacent nodes. Requests using OB are vulnerable to attack propagation because OB allows signals to pass through multiple nodes without regeneration, enabling interference to spread across downstream links. If there is an attack on the middle link, it affects requests 1, 2, and 4, with OB propagating the impact to request 3, keeping the NAR at 4. Note that the quantum c… view at source ↗
Figure 3
Figure 3. Results for PoliQi topology. We evaluate the performance of the Min-maxNAR al￾gorithm under three different architectures (OB-TR, OB, and TR). We first benchmark the performance of the in￾maxNAR algorithm compared to the ILP in a five-node ring topology (as in the PoliQi QKD testbed currently being deployed in Milan [5]). Each node has ten modules. We consider 7 requests, and each request requires 10kb/s during each… view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Result in NSF topology: compared with baseline with [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: Result in NSF topology with α = 0 & α = 80 second timeslot. By the third and fourth timeslots, maxNAR stabilizes around 1 to 2 as QKP reserves meet demand. A slight rise occurs in the final slot as keys are nearly depleted, but the heuristic still outperforms, demonstr…
Figure 6
Figure 6. Figure 6: Result for 5 timeslot with 145 requests IV. CONCLUSION This paper addresses QKD network vulnerability to physical-layer attacks by formulating the RWA-MAR prob￾lem and developing both an ILP model and a scalable TABU-based heuristic to solve it. The ILP and heuristic a…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 18 canonical work pages

  1. [1]

    The evolution of quantum key distribution networks: On the road to the qinternet,

    Y . Caoet al., “The evolution of quantum key distribution networks: On the road to the qinternet,”IEEE CST, 2022

    work page 2022

  2. [2]

    An integrated space-to-ground quantum commu- nication network over 4,600 kilometres,

    Y .-A. Chenet al., “An integrated space-to-ground quantum commu- nication network over 4,600 kilometres,”Nature, 2021

    work page 2021

  3. [3]

    Time-scheduled quantum key distribution ...,

    Y . Caoet al., “Time-scheduled quantum key distribution ...,”J. Light. Technol, 2018

    work page 2018

  4. [4]

    Deploying the qline system for a qkd metropolitan network on the berlin openqkd testbed,

    M. Senaet al., “Deploying the qline system for a qkd metropolitan network on the berlin openqkd testbed,”IEEE Photonics J, 2024

    work page 2024

  5. [5]

    Routing, channel, key-rate, and time-slot assignment for qkd in optical networks,

    Q. Zhanget al., “Routing, channel, key-rate, and time-slot assignment for qkd in optical networks,”IEEE TNSM, 2024

    work page 2024

  6. [6]

    Physical-layer attacks in all-optical wdm networks,

    M. Furdeket al., “Physical-layer attacks in all-optical wdm networks,” in2011 MIPRO, IEEE, 2011

    work page 2011

  7. [7]

    Out-of-band electromagnetic injection attack on a quantum random number generator,

    P. Smithet al., “Out-of-band electromagnetic injection attack on a quantum random number generator,”Physical Review Applied, 2021

    work page 2021

  8. [8]

    Securing iot systems in a post-quantum environ- ment: Vulnerabilities, attacks, and possible solutions,

    A. Alomariet al., “Securing iot systems in a post-quantum environ- ment: Vulnerabilities, attacks, and possible solutions,”IoT, 2024

    work page 2024

Show all 19 references
  1. [9]

    The debate over qkd: A rebuttal to the nsa’s objections,

    R. Renner and R. Wolf, “The debate over qkd: A rebuttal to the nsa’s objections,”arXiv preprint arXiv:2307.15116, 2023

    2023 arXiv

  2. [10]

    Breaking rainbow takes a weekend on a laptop,

    W. Beullens, “Breaking rainbow takes a weekend on a laptop,” in CRYPTO, Springer, 2022

    2022

  3. [11]

    A bb84 qkd field-trial in the turin metropolitan area,

    A. Gattoet al., “A bb84 qkd field-trial in the turin metropolitan area,” inPhotonics in Switching and Computing, 2021

    2021

  4. [12]

    Architecture and protocols of the future european quantum key distribution network,

    M. Dianatiet al., “Architecture and protocols of the future european quantum key distribution network,”SCN, 2008

    2008

  5. [13]

    Demonstration of a switched cv-qkd network,

    H. H. Brunneret al., “Demonstration of a switched cv-qkd network,” EPJ Quantum Technology, 2023

    2023

  6. [14]

    Auxiliary graph based routing, wavelength, and time- slot assignment...,

    K. Donget al., “Auxiliary graph based routing, wavelength, and time- slot assignment...,”Optics express, 2020

    2020

  7. [15]

    Drl-based progressive recovery for quantum-key- distribution networks,

    M. Liet al., “Drl-based progressive recovery for quantum-key- distribution networks,”JOCN, 2024

    2024

  8. [16]

    Security challenges to iot and cloud-based systems in the era of quantum attacks,

    V . Mani, “Security challenges to iot and cloud-based systems in the era of quantum attacks,” Springer, 2024

    2024

  9. [17]

    Tabu search: A tutorial,

    F. Glover, “Tabu search: A tutorial,”Interfaces, vol. 20, no. 4, pp. 74– 94, 1990

    1990

  10. [18]

    Evolutionary algorithms, simulated annealing and tabu search: a comparative study,

    H. Youssefet al., “Evolutionary algorithms, simulated annealing and tabu search: a comparative study,”Eng. Appl. Artif. Intell., 2001

    2001

  11. [19]

    On the energy efficiency of physical topology design for ip over wdm networks,

    X. Donget al., “On the energy efficiency of physical topology design for ip over wdm networks,”J. Light. Technol., 2012

    2012

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.