Quantum-Adversary-Resilient Evidence Structures and Migration Strategies for Regulated AI Audit Trails

• URL: http://arxiv.org/abs/2512.00110v1
• Date: Thu, 27 Nov 2025 12:57:44 GMT
• Title: Quantum-Adversary-Resilient Evidence Structures and Migration Strategies for Regulated AI Audit Trails
• Authors: Leo Kao,
• Abstract summary: Constant-size cryptographic evidence records are increasingly used to build audit trails for regulated AI workloads in clinical, pharmaceutical, and financial settings.<n>Existing instantiations, however, rely on classical signature schemes whose long-term security is threatened by quantum-capable adversaries.<n>This paper formalizes security notions for evidence structures in the presence of quantum adversaries and study post-quantum instantiations and migration strategies for deployed audit logs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Constant-size cryptographic evidence records are increasingly used to build audit trails for regulated AI workloads in clinical, pharmaceutical, and financial settings, where each execution is summarized by a compact, verifiable record of code identity, model version, data digests, and platform measurements. Existing instantiations, however, typically rely on classical signature schemes whose long-term security is threatened by quantum-capable adversaries. In this paper we formalize security notions for evidence structures in the presence of quantum adversaries and study post-quantum (PQ) instantiations and migration strategies for deployed audit logs. We recall an abstraction of constant-size evidence structures and introduce game-based definitions of Q-Audit Integrity, Q-Non-Equivocation, and Q-Binding, capturing the inability of a quantum adversary to forge, equivocate, or rebind evidence items. We then analyze a hash-and-sign instantiation in the quantum random-oracle model (QROM), assuming an existentially unforgeable PQ signature scheme against quantum adversaries, and show that the resulting evidence structure satisfies these notions under standard assumptions. Building on this, we present three migration patterns for existing evidence logs: hybrid signatures, re-signing of legacy evidence, and Merkle-root anchoring, and analyze their security, storage, and computational trade-offs. A case study based on an industrial constant-size evidence platform for regulated AI at Codebat Technologies Inc. suggests that quantum-safe audit trails are achievable with moderate overhead and that systematic migration can significantly extend the evidentiary lifetime of existing deployments.

Related papers

• A TEE-Based Architecture for Confidential and Dependable Process Attestation in Authorship Verification [0.0]
  We present the first architecture for continuous process attestation evidence collection inside Trusted Execution Environments (TEEs)<n>We provide hardware-backed tamper resistance against trust-inverted adversaries with graduated input assurance from software-channel integrity (Tier 1) through hardware-bound input (Tier 3)<n>We introduce a resilient evidence chain protocol maintaining chain integrity across TEE crashes, network partitions, and enclave migration.
  arXiv  Detail & Related papers  (2026-02-26T20:17:52Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Formal Verification of Variational Quantum Circuits [44.06507276521908]
  Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms.<n>We present the first in-depth theoretical and practical study of the formal verification problem for VQCs.
  arXiv  Detail & Related papers  (2025-07-14T12:28:32Z)
• On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains [0.0]
  We introduce the concept of the Merkle Automaton, a cryptographically anchored, deterministic computational framework.<n>Each agent transition, memory fragment, and reasoning step is committed within a Merkle structure rooted on-chain.<n>This architecture reframes memory not as a cache but as a ledger - one whose contents are enforced by protocol, bound by cryptography, and constrained by formal logic.
  arXiv  Detail & Related papers  (2025-06-16T08:43:56Z)
• Device-Independent Quantum Key Distribution: Protocols, Quantum Games, and Security [0.0]
  Quantum Key Distribution (QKD) is based on the laws of quantum mechanics to enable provably secure communication.<n>Despite its theoretical security promise, practical QKD systems are vulnerable to serious attacks, including side-channel attacks and detector loopholes.<n> Device-Independent Quantum Key Distribution (DIQKD) overcomes these limitations by relying solely on observed nonlocal correlations.
  arXiv  Detail & Related papers  (2025-05-20T11:52:21Z)
• A classical proof of quantum knowledge for multi-prover interactive proof systems [1.5749416770494706]
  In a proof of knowledge (PoK) a verifier becomes convinced that a prover possesses privileged information.<n>We present the first statistical zero-knowledge (ZK) PoK proof system for problems in QMA.<n>Our result can be seen as a new form of self-testing, where, in addition to certifying a pre-shared entangled state, the verifier also certifies that a prover has access to a quantum system.
  arXiv  Detail & Related papers  (2025-03-17T20:16:22Z)
• Quantum Rewinding for IOP-Based Succinct Arguments [42.12045681000549]
  We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing.<n>As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best complexity known.
  arXiv  Detail & Related papers  (2024-11-08T06:33:08Z)
• Evidence Tampering and Chain of Custody in Layered Attestations [0.0]
  In distributed systems, trust decisions are made on the basis of integrity evidence generated via remote attestation. We present algorithms for identifying all such tampering opportunities for given evidence as well as tampering "strategies" by which an adversary can modify incriminating evidence without being detected. Our efforts are intended to help protocol designers ensure their protocols reduce evidence tampering opportunities to the smallest, most trustworthy set of components possible.
  arXiv  Detail & Related papers  (2024-01-31T21:54:53Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Quantum-secure message authentication via blind-unforgeability [74.7729810207187]
  We propose a natural definition of unforgeability against quantum adversaries called blind unforgeability. This notion defines a function to be predictable if there exists an adversary who can use "partially blinded" access to predict values. We show the suitability of blind unforgeability for supporting canonical constructions and reductions.
  arXiv  Detail & Related papers  (2018-03-10T05:31:38Z)

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.