A Formal Basis for Quantum Cryptographic Exposure Measurement under HNDL Threat
- URL: http://arxiv.org/abs/2605.22569v1
- Date: Thu, 21 May 2026 14:48:26 GMT
- Title: A Formal Basis for Quantum Cryptographic Exposure Measurement under HNDL Threat
- Abstract summary: We show that the functional form of the answer is not merely a calibration choice.<n>It is structurally justified by three assumptions about adversarial production and value-decay dynamics.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: An adversary copies your encrypted traffic today and waits for a quantum computer to decrypt it later. How exposed are you? We show that the functional form of the answer is not merely a calibration choice -- it is structurally justified by three assumptions about adversarial production and value-decay dynamics. Under those assumptions, the HNDL compromise probability factorises into a temporal hazard, a multiplicative cryptographic-vulnerability and operational-exposure term, and a saturation denominator governed by the defense-attack intensity ratio; the marginal sensitivity to each dimension is endogenous to the organisation's position in the vulnerability-exposure plane, not a fixed global constant. Additive scoring frameworks cannot reproduce this structure because the interaction between cryptographic vulnerability and operational exposure is absent by construction, regardless of calibration. The resulting framework provides a structurally grounded basis for operational HNDL exposure prioritisation under partial observability.
Related papers
- Non-Degenerate Risk Certification for Automated Security Decisions: A Decision-Contract Theory with ATT\&CK-Aligned Triage as a Worked Instance [1.4915002678801434]
An unconditional risk bound on automated decisions can be satisfied without automating anything, since a selector that never acts drives the bound to zero.<n>We show this is structural: any risk certificate is defined over a decision contract, the inputs a system acts on plus the semantic relation under which an output counts correct.<n>We develop a decision-contract theory: an error-conservation law showing error is only reassigned among harmful automation, human deferral, and semantic masking.
arXiv Detail & Related papers (2026-08-12T16:59:19Z) - Conformal Changepoint Localization and Root Cause Analysis with Corrupted Observations [55.76952683833966]
This paper proposes weighted CONCH (W-CONCH) and weighted CROC (W-CROC) to reduce confidence set size when data may be corrupted.<n>Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting substantially reduces confidence set size.
arXiv Detail & Related papers (2026-07-29T05:16:59Z) - Geometric Collapse: When Vision Models Fail to Verify Physical Causality [52.43819179934414]
We propose Scrambled Edges, a controlled counterfactual that injects salient edge-like cues.<n>With energy-matched and structure-matched controls, we isolate the effect of unsupported edge evidence from high-frequency energy and edge sparsity.<n>Across CNN/ViT/SSL depth predictors, Scrambled Edges induce up to 3.2x larger deviation from clean predictions than energy-matched noise.
arXiv Detail & Related papers (2026-07-08T00:04:02Z) - Semantic Non-Assembly: Privacy by Architectural Inertness Under Component Exposure [0.0]
We introduce a class of privacy guarantee (Semantic Non-Assembly)<n>In SNA, privacy is characterized not by the difficulty of achieving exposure but by the information yield of exposure when it occurs.<n>This paper formalizes the guarantee and establishes four ProVerif-verified properties.
arXiv Detail & Related papers (2026-06-21T02:40:29Z) - Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy [51.758416625168]
Randomized smoothing is a powerful tool for certifying robustness to adversarial perturbations.<n>We propose a framework for certification of complex, composed mechanisms.<n>We provide a principled and general framework for using composite mechanisms to certify robustness under complex threat models.
arXiv Detail & Related papers (2026-05-20T22:17:29Z) - UnGAP: Uncertainty-Guided Affine Prompting for Real-Time Crack Segmentation [16.902729686979303]
Uncertainty-Prompted Feature Modulator (UPFM) treats aleatoric uncertainty as an active visual prompt rather than a mere output.<n>UnGAP balances superior segmentation accuracy with real-time inference speed.
arXiv Detail & Related papers (2026-05-04T09:18:57Z) - Neural Uncertainty Principle: A Unified View of Adversarial Fragility and LLM Hallucination [60.197429875410286]
Adversarial vulnerability in vision and hallucination in large language models are conventionally viewed as separate problems.<n>Formalizing a Neural Uncertainty Principle (NUP) under a loss-induced state, we find that in near-bound regimes, further compression must be accompanied by increased sensitivity dispersion.<n>In vision, masking highly coupled components improves robustness without costly adversarial training.<n>In language, the same prefill-stage probe detects hallucination risk before generating any answer tokens.
arXiv Detail & Related papers (2026-03-20T02:07:10Z) - When Backdoors Go Beyond Triggers: Semantic Drift in Diffusion Models Under Encoder Attacks [2.4923006485141284]
We demonstrate that encoder-side poisoning induces persistent, trigger-free semantic corruption.<n> backdoors act as low-rank, target-centered deformations that amplify local sensitivity, causing distortion to propagate coherently across semantic neighborhoods.<n>Our findings, validated across diffusion and contrastive paradigms, expose the deep structural risks of encoder poisoning and highlight the necessity of geometric audits beyond simple attack success rates.
arXiv Detail & Related papers (2026-02-21T23:48:04Z) - Causal Inference on Networks under Misspecified Exposure Mappings: A Partial Identification Framework [66.59051888063665]
We propose a novel partial identification framework for causal inference on networks.<n>We derive sharp upper and lower bounds on direct and spillover effects under misspecifications of the exposure mapping.<n>Our experiments show the bounds remain informative and provide reliable conclusions under misspecification of exposure mappings.
arXiv Detail & Related papers (2026-02-03T12:27:11Z) - NeuroFilter: Privacy Guardrails for Conversational LLM Agents [50.75206727081996]
This work addresses the computational challenge of enforcing privacy for agentic Large Language Models (LLMs)<n>NeuroFilter is a guardrail framework that operationalizes contextual integrity by mapping norm violations to simple directions in the model's activation space.<n>A comprehensive evaluation across over 150,000 interactions, covering models from 7B to 70B parameters, illustrates the strong performance of NeuroFilter.
arXiv Detail & Related papers (2026-01-21T05:16:50Z) - Open-Set LiDAR Panoptic Segmentation Guided by Uncertainty-Aware Learning [17.188627352236782]
We propose ULOPS, an uncertainty-guided open-set panoptic segmentation framework.<n>Our architecture incorporates separate decoders for semantic segmentation with uncertainty estimation.<n>During inference, we leverage uncertainty estimates to identify and segment unknown instances.
arXiv Detail & Related papers (2025-06-16T09:03:51Z) - Spatial-Frequency Discriminability for Revealing Adversarial Perturbations [53.279716307171604]
Vulnerability of deep neural networks to adversarial perturbations has been widely perceived in the computer vision community.
Current algorithms typically detect adversarial patterns through discriminative decomposition for natural and adversarial data.
We propose a discriminative detector relying on a spatial-frequency Krawtchouk decomposition.
arXiv Detail & Related papers (2023-05-18T10:18:59Z)
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.