Information-theoretic limits on undetectable parameter-estimation attacks in continuous-variable quantum key distribution

• URL: http://arxiv.org/abs/2607.24855v1
• Date: Sat, 25 Jul 2026 23:36:36 GMT
• Title: Information-theoretic limits on undetectable parameter-estimation attacks in continuous-variable quantum key distribution
• Abstract summary: We formalize a certificate-forgery hypothesis test and identify its detectability with an information-theoretic rate.<n>Relative to a set $mathcalM$ of trusted observables, the forgery- detectability rate $g_mathcal M$ of a benign-statistics certificate is the missed-detection Stein exponent.
• Score: 1.7205106391379026
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We formalize side-channel detection in Gaussian-modulated continuous-variable quantum key distribution (CV-QKD) as a certificate-forgery hypothesis test and identify its detectability with an information-theoretic rate. Relative to a set $\mathcal{M}$ of trusted, real-time-monitored observables, the forgery- detectability rate $g_{\mathcal M}$ of a benign-statistics certificate is the missed-detection Stein exponent. We prove a dichotomy: $g_{\mathcal M}$ is monotone and strictly positive in the leaked Holevo information when the shot- noise unit is trusted, and identically zero otherwise, recovering local- oscillator and calibration attacks as the degenerate case. Monotonicity yields a certificate reusability rate bounding the Holevo leakage compatible with an undetected certificate over $N_{\mathrm{PE}}$ estimation rounds, via the non- asymptotic bound $\varepsilon_{\mathrm{PE}}\le\exp(-N_{\mathrm{PE}}ψ(r))$ whose near-threshold expansion matches the Gaussian confidence-interval scaling of standard finite-size analyses. We then give a composable finite-size key- length statement under collective Gaussian attacks, whose worst-case Holevo term is the reusability rate and whose parameter-estimation failure probability is bounded by the Stein exponent at every block length. Both results are unconditional in the trusted-correlation model, where strict monotonicity of the Holevo leakage in the excess noise follows from a noise-injection argument; for general $\mathcal{M}$ they hold under an explicit no-spurious-local-minima condition on the divergence landscape, verifiable by low-dimensional inspection. Convexity of the rate further assumes a numerically supported concavity of the Holevo bound, the sole numerical ingredient; proof status is delimited throughout.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Finite-Probe Total-Variation Certificates for Finite-Basis Drifting Models [1.2072720711193232]
  We describe a frozen measurement system for integrable antisymmetric interactions and absolutely continuous laws in a declared finite density basis.<n>For Gaussian-RBF interactions, a global envelope supports distribution-free and empirical-Bernstein radii without truncation.<n>We characterize random-probe observability by a population Gram matrix, identify rank and symmetry degenera, and prove large-bandwidth collapse toward mean matching.
  arXiv  Detail & Related papers  (2026-08-03T00:00:40Z)
• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Conformal calibration and look-elsewhere effect in anomaly detection for new-physics searches [0.0]
  Machine-learned anomaly detection is reshaping searches for new physics, but it has outrun the statistics used to interpret it.<n>We propose a calibration layer, built on conformal prediction, that turns any anomaly score into a defensible significance.
  arXiv  Detail & Related papers  (2026-06-11T18:00:02Z)
• Is Spurious Correlation Removal Always Learnable? [56.28155520961125]
  Invariant learning can fail even when the structure is statistically identifiable.<n>We show a conditional computational barrier: under a black-box samplable supervised sparse recovery primitive, there exist emphamplable multi-dimensional environments.<n>Synthetic and real datasets illustrate the predicted gaps and transitions and motivate simple diversity diagnostics.
  arXiv  Detail & Related papers  (2026-06-11T05:49:43Z)
• Squeezed-state semi-device-independent quantum randomness generation [0.0]
  This paper investigates semi-device-independent quantum randomness generation with a trusted binary pure-state source and an untrusted binary detector.<n>We derive a closed-form Shannon-rate expression for this setting, depending only on the trusted Gram overlap of the two source states.<n>We then apply the result to squeezed-coherent BPSK sources, showing how squeezing changes the trade-off between state distinguishability and certified randomness.
  arXiv  Detail & Related papers  (2026-06-02T16:54:29Z)
• Detectability Limits for Intra-Block Temporal Drift in Finite-Key Entanglement-Based QKD [0.0]
  We study the statistical detectability of intra-block temporal drift in finite-key entanglement-based quantum key distribution.<n>Dread is modeled as a mean-preserving Lipschitz perturbation of Bernoulli observables, capturing structured temporal variation.<n>The result quantifies a finite-block monitoring-resolution limit and is distinct from composable security certification.
  arXiv  Detail & Related papers  (2026-05-22T21:18:46Z)
• Adaptive Confidence Intervals in Efron's Gaussian Two-Groups Model [28.636700996382558]
  Motivated by noise-oblivious nature of adversaries, we study confidence intervals for the null location parameter $$ in Efron's Gaussian two-groups fraction model.<n>We characterize the minimax-optimal length among confidence intervals with a prescribed coverage level uniformly over the unknown proportion contamination and all noise-oblivious adversaries.
  arXiv  Detail & Related papers  (2026-04-28T22:40:54Z)
• Stabilizing Fixed-Point Iteration for Markov Chain Poisson Equations [49.702772230127465]
  We study finite-state Markov chains with $n$ states and transition matrix $P$.<n>We show that all non-decaying modes are captured by a real peripheral invariant subspace $mathcalK(P)$, and that the induced operator on the quotient space $mathbbRn/mathcalK(P) is strictly contractive, yielding a unique quotient solution.
  arXiv  Detail & Related papers  (2026-01-31T02:57:01Z)
• Operationally induced preferred basis in unitary quantum mechanics [0.0]
  The preferred-basis problem and the definite-outcome aspect of the measurement problem persist even if the detector is modeled unitarily.<n>A change of mathematical type constitutes the core of the 'cut': a structurally necessary interface from group-based kinematics to set-based counting.
  arXiv  Detail & Related papers  (2026-01-26T17:22:03Z)
• Non-asymptotic bounds for forward processes in denoising diffusions: Ornstein-Uhlenbeck is hard to beat [49.1574468325115]
  This paper presents explicit non-asymptotic bounds on the forward diffusion error in total variation (TV)<n>We parametrise multi-modal data distributions in terms of the distance $R$ to their furthest modes and consider forward diffusions with additive and multiplicative noise.
  arXiv  Detail & Related papers  (2024-08-25T10:28:31Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.