Canonicalization Failures as a Recurring Vulnerability Class: Representation Divergence in Cryptographic Systems and Its Avoidance

• URL: http://arxiv.org/abs/2608.06508v1
• Date: Thu, 06 Aug 2026 18:47:32 GMT
• Title: Canonicalization Failures as a Recurring Vulnerability Class: Representation Divergence in Cryptographic Systems and Its Avoidance
• Abstract summary: This work organizes the scattered findings systematically.<n>It shows that they are instances of one violated uniqueness condition, along two basic directions.<n>The contribution is explicitly not the discovery of the phenomenon, but is threefold.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cryptographic systems operate on bytes but mean semantic objects. The translation between the two is rarely unique. Where this uniqueness is not enforced, an attack surface opens up as soon as a hash, a signature, replay protection, or consensus identity depends on the representation. The same class of failure has been discovered independently and named locally across many ecosystems, as transaction malleability, non-deterministic value encoding, message malleability, or hash chain malleability, without its common root being tracked as a cross-ecosystem grid. This work organizes the scattered findings systematically: it shows that they are instances of one violated uniqueness condition, along two basic directions: multiple valid codes for one object (object-side multiple representation) or one code for multiple objects (code-side semantic collapse). The contribution is explicitly not the discovery of the phenomenon, but is threefold: the systematization by representation mechanism rather than by affected system, the bridge between classical canonicalization security and a representation- and computability-theoretic foundation, and the translation into an applicable review procedure (a canonicalization obligation with a sequence of review steps, a field-type classification, and an operational boundary model) with which the risk can be recognized preventively. We substantiate the class with worked-out cases, delimit it against incidents that are not representation problems, and deliberately keep the claims to what is demonstrable: enforced uniqueness can reduce the exploitability of a failure class, but it neither replaces further protective measures or makes any statement about cryptographic security in the narrower sense

Related papers

• Renaming or Tightness: Enforcing Disjunctive Information Flow Policies [7.541234468065092]
  A disjunctive policy allows a value to depend on at most one of two secrets and never on both.<n>Hunt and Sands introduced the quantale of information to give them a semantics, leaving the enforcement layer open.<n>We build the flow-sensitive type system family that the quantale calls for, and show that the object which makes such families useful splits in two.
  arXiv  Detail & Related papers  (2026-08-10T04:53:10Z)
• A Verifier-Centric Conceptual Model for Digital Credential Ecosystems [0.0]
  We present a verifier-centric conceptual model built on two decompositions.<n>We show that it explains interoperability failures, verifier-side burden, offline verifiability, privacy implications, and terminological ambiguities that element-wise comparison leaves unresolved.
  arXiv  Detail & Related papers  (2026-07-12T12:59:26Z)
• Algorithmically Presented Numbers and Canonical Representations in Cryptographic Protocols [0.0]
  The focus is not solely on the computability of the abstract value as an extensional property, but on the algorithmic structure of its presentation in a representation system.<n>We distinguish three representation-theoretic notions -- algorithmically approximable (A_app), the computable real numbers, and finitely exactly describable in a system.<n>We show that there is no computable extensional canonicalizer that uniformly transforms arbitrary approximation programs of computable real numbers into unique finite value encodings.
  arXiv  Detail & Related papers  (2026-07-06T12:56:58Z)
• 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)
• (Quantum) Indifferentiability and Pre-Computation [50.06591179629447]
  Indifferentiability is a cryptographic paradigm for analyzing the security of ideal objects. Despite its strength, indifferentiability is not known to offer security against pre-processing attacks. We propose a strengthening of indifferentiability which is not only composable but also takes arbitrary pre-computation into account.
  arXiv  Detail & Related papers  (2024-10-22T00:41:47Z)
• Supervised and Unsupervised Alignments for Spoofing Behavioral Biometrics [7.021534792043867]
  Biometric recognition systems are based on intrinsic properties of their users, usually encoded in high dimension representations called embeddings. We perform spoofing attacks on two behavioral biometric systems using a set of alignment techniques.
  arXiv  Detail & Related papers  (2024-08-14T20:46:59Z)
• Data Reconstruction: When You See It and When You Don't [75.03157721978279]
  We aim to "sandwich" the concept of reconstruction attacks by addressing two complementing questions.<n>We introduce a new definitional paradigm -- Narcissus Resiliency -- to formulate a security definition for protection against reconstruction attacks.
  arXiv  Detail & Related papers  (2024-05-24T17:49:34Z)
• Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages [14.150289683819759]
  We introduce the notions of split-state non-malleable codes and secret sharing schemes for quantum messages secure against quantum adversaries with shared entanglement. More precisely, we construct efficiently encodable and decodable split-state non-malleable codes and secret sharing schemes for quantum messages preserving entanglement with external systems.
  arXiv  Detail & Related papers  (2023-08-12T05:15:35Z)
• 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)
• 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)
• Asymmetric Modality Translation For Face Presentation Attack Detection [55.09300842243827]
  Face presentation attack detection (PAD) is an essential measure to protect face recognition systems from being spoofed by malicious users. We propose a novel framework based on asymmetric modality translation forPAD in bi-modality scenarios. Our method achieves state-of-the-art performance under different evaluation protocols.
  arXiv  Detail & Related papers  (2021-10-18T08:59:09Z)
• Prototype-supervised Adversarial Network for Targeted Attack of Deep Hashing [65.32148145602865]
  deep hashing networks are vulnerable to adversarial examples. We propose a novel prototype-supervised adversarial network (ProS-GAN) To the best of our knowledge, this is the first generation-based method to attack deep hashing networks.
  arXiv  Detail & Related papers  (2021-05-17T00:31:37Z)

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.