Nothing Breaks: No Single Peer Can Soundly Gate Post-Quantum Delivery

• URL: http://arxiv.org/abs/2609.07849v1
• Date: Mon, 07 Sep 2026 18:08:08 GMT
• Title: Nothing Breaks: No Single Peer Can Soundly Gate Post-Quantum Delivery
• Abstract summary: Post-quantum protection is delivered to a peer, not declared in a file.<n>We show that no single peer can soundly gate that relation.<n>We then show that agents make that state reachable at scale, driving a validated downgrade in 40 of 40 episodes from ordinary engineering prose.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Post-quantum protection is delivered to a peer, not declared in a file: whether a session is quantum-resistant is a relation between a server's configuration and the clients that reach it. We show that no single peer can soundly gate that relation. Shipped SSH clients are not ordered: two of their post-quantum capability classes are minimal and incomparable, so a check pinned to either misses the other family's withdrawal. A peer taking both fares no better: it falls back and misses both, or, where classical outranks one family, catches just that one. No case flags both. Nothing above the wire carries the relation either. An artifact-side instrument cannot encode it, because a peer population is not one of its inputs; and across seven configurations on two protocols we find that not one of the five scalars deployed auditors expose to automation moves, while unrelated degradation moves the ones that discriminate at all: the auditors do compute the delivered algorithm, and discard it at the interface automation reads. Nothing else catches the loss either, because nothing breaks: removing a hybrid key exchange starts the daemon, validates the configuration, passes the tests and serves the client, and the adversary it defends against does not exist yet, so no functional signal can carry the loss even in principle. We then show that agents make that state reachable at scale, driving a validated downgrade in 40 of 40 episodes from ordinary engineering prose, against 0 of 40 on a matched neutral document.

Related papers

• Keyless secrecy against bounded adversaries [2.064612766965483]
  We introduce a keyless coding/crypt computation primitive that asks for two guarantees at once.<n>Neither the sender nor the receiver holds a secret key, and no computational hardness is assumed.<n>We obtain the first efficient non-malleable code secure against global quantum tampering.
  arXiv  Detail & Related papers  (2026-09-10T22:17:06Z)
• IBIB: A Protocol for Measuring Enterprise AI Systems by Serving Route, Not Model Identifier [0.0]
  All 18 audited benchmarks score advertised model identifiers.<n>A gold-blind capability-binding preflight verifies that a route can execute the evaluation contract before any task reaches it.<n>A reliability-inclusive first-pass scoring rule keeps failure in the score while keeping unsupported capability out.
  arXiv  Detail & Related papers  (2026-09-09T17:31:29Z)
• AI-Assisted Design of a Post-Quantum Cryptographic Accelerator: A Deployed-Silicon Case Study [0.4251773265892765]
  We replace the standard acceptance gate with a byte-exact goldenreference oracle.<n>We report 232 experiments in which an agentic large language model drove a unified ML-KEM-768 and ML-DSA-65 accelerator.
  arXiv  Detail & Related papers  (2026-09-03T16:34:50Z)
• Bilevel Coordinated Reflection: A Game-Theoretic Approach to Multi-Agent LLM Systems [40.47928908205563]
  Multi-agent LLM systems commonly use an orchestrator to decompose a task for a team of workers and then improve through textual reflection.<n>Despite strong empirical results, these systems lack a unified account of coordination, memory improvement, and the role of external verification.<n>We provide confidence gating for evaluation and re-anchoring guarantees for piecewise-stationary environments.<n>Experiments instantiate these objects with environment-grounded metrics and test the predicted coordination and drift laws.
  arXiv  Detail & Related papers  (2026-09-02T15:50:10Z)
• MCSI: A Masked Commutative Supersingular Isogeny Key Exchange with Blinded Ephemeral Keys [0.0]
  We introduce MCSI, a two message key exchange we design over the CSIDH class group action.<n>The design gives implicit mutual authentication, hides the ephemeral element from an eavesdropper, and lets a recipient discard an unauthenticated message after one tag check.<n>On the analytic side, we prove that our protocol is correct with zero error, and prove three statements in the random oracle model.<n>We also show that a blinding key cannot come from the session secret it is meant to establish.
  arXiv  Detail & Related papers  (2026-08-23T10:59:30Z)
• CallScreenBench: Benchmarking On-Device Models as Phone Secretaries [3.917303377795418]
  A phone secretary takes an unknown inbound call on its owner's behalf.<n>Unlike the agents evaluated by most benchmarks, it has no task to complete and no cooperative user.<n>We present CallScreenBench, which scores this setting on five quality dimensions.
  arXiv  Detail & Related papers  (2026-08-02T06:31:25Z)
• GPUAlert: A Zero-Instrumentation Process-Boundary Monitor for Diagnosing GPU Training-Job Failures [34.01019358995093]
  GPUAlert is a command-line wrapper that monitors any training command at the process boundary.<n>It emails a structured notification on completion carrying a classified failure cause, durable logs, and output artifacts.<n>We release a labelled corpus of 474 GPU training logs across 15 failure classes and a reproducible evaluation harness.
  arXiv  Detail & Related papers  (2026-07-01T19:15:16Z)
• The Proxy Knows Too Much: Sealing LLM API Routers with Attested TEEs [14.19502587458358]
  AEGIS is a provider-transparent API router whose data path is a client-verified faithful passthrough.<n>We show that all four malicious-router attack classes succeed against a plaintext-access baseline.<n>The trusted path is $851$ lines, carries three provider-native APIs without conversion, and completes every request under real-provider workload and typos.
  arXiv  Detail & Related papers  (2026-06-15T07:55:13Z)
• SNARE: Adaptive Scenario Synthesis for Eliciting Overeager Behavior in Coding Agents [40.270213696031625]
  A coding agent executes a benign task as a sequence of shell, file, and network actions, any of which can quietly exceed the authorized scope while the task still completes.<n>We call this overeager behavior: the prompt is not adversarial and the run succeeds, yet an out-of-scope step can leak credentials or delete files.<n>Existing benchmarks miss it: task-completion suites credit any finished run, jailbreak suites probe adversarial prompts, and the one prior overeager benchmark applies a single fixed prompt to every agent-model pair.<n>We present SNARE, a pipeline that composes benign scenarios from reusable scope
  arXiv  Detail & Related papers  (2026-05-27T08:14:07Z)
• A Universal Cliff and a Design Fingerprint: Cross-Section Defect Detection Under LLM Orchestration [0.0]
  Production language-model systems answer a request byspanning it across an invisible orchestration of worker agents.<n>We ask what this does to a class of defect no single worker can see.<n>We vary only the model -- ten systems across five generations from one developer and five providers from distinct alignment paradigms.
  arXiv  Detail & Related papers  (2026-05-25T05:09:48Z)
• MOSS: Self-Evolution through Source-Level Rewriting in Autonomous Agent Systems [36.221246203666745]
  MOSS is a system that performs self-rewriting at the source level on production agentic substrates.<n>It lifts a four-task mean grader score from 0.25 to 0.61 in a single cycle without human intervention.
  arXiv  Detail & Related papers  (2026-05-21T17:48:33Z)
• Is Agentic AI Ready for Real-World Hardware Engineering? A Deep Dive with Phoenix-bench [33.69401287706814]
  We ask whether agentic AI systems built for software engineering transfer to realistic hardware engineering.<n>We introduce textbfPhoenix-bench, a synchronized corpus of 511 verified Verilator instances from 114 GitHub repositories.<n>Using Phoenix-bench we run a uniform evaluation of four commercial agents and eight open-source agentic structures.
  arXiv  Detail & Related papers  (2026-05-13T14:14:54Z)
• Can Quantum Computers Do Nothing? [44.99833362998488]
  In idling qubits, information can 'leak' into neighbouring qubits, become non-locally distributed, and ultimately inaccessible. No information-theoretic protocol exists to quantify this information loss due to internal dynamics. We implement this protocol in over 3500 experiments carried out across 4 months on IBM's entire Falcon 5.11 series of processors.
  arXiv  Detail & Related papers  (2024-06-24T17:59:45Z)

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.