ZK-ACE: Identity-Centric Zero-Knowledge Authorization for Post-Quantum Blockchain Systems

• URL: http://arxiv.org/abs/2603.07974v1
• Date: Mon, 09 Mar 2026 05:21:44 GMT
• Title: ZK-ACE: Identity-Centric Zero-Knowledge Authorization for Post-Quantum Blockchain Systems
• Abstract summary: ZK-ACE is an authorization layer that replaces transaction-carried signature objects with identity-bound zero-knowledge authorization statements.<n>We formalize ZK-ACE with explicit game-based security definitions for authorization soundness, replay resistance, substitution resistance, and cross-domain separation.<n>A structural, protocol-level data accounting demonstrates an order-of-magnitude reduction in consensus-visible authorization data relative to direct post-quantum signature deployment.
• Score: 1.7429038786735553
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Post-quantum signature schemes introduce kilobyte-scale authorization artifacts when applied directly to blockchain transaction validation. A widely considered mitigation is to verify post-quantum signatures inside zero-knowledge circuits and publish only succinct proofs on-chain. However, this approach preserves the signature-centric authorization model, merely relocating the verification cost, and embeds expensive high-dimensional lattice arithmetic into prover circuits.We present ZK-ACE (Zero-Knowledge Authorization for Cryptographic Entities), an authorization layer that replaces transaction-carried signature objects entirely with identity-bound zero-knowledge authorization statements. Rather than proving the correctness of a specific post-quantum signature, the prover demonstrates in zero knowledge that a transaction is authorized by an identity consistent with an on-chain commitment and bound replay state. The construction assumes a deterministic identity derivation primitive (DIDP) as a black box and uses a compact identity commitment as the primary on-chain identity anchor, supplemented by per-transaction replay-prevention state. We formalize ZK-ACE with explicit game-based security definitions for authorization soundness, replay resistance, substitution resistance, and cross-domain separation. We present a complete circuit constraint specification, define two replay-prevention models, and provide reduction-based security proofs under standard assumptions (knowledge soundness, collision resistance, and DIDP identity-root recovery hardness). A structural, protocol-level data accounting demonstrates an order-of-magnitude reduction in consensus-visible authorization data relative to direct post-quantum signature deployment. The design supports batch aggregation and recursive proof composition, and is compatible with account-abstraction and rollup-based deployment architectures.

Related papers

• GoodDiffusion: Proactive Copyright Protection for Diffusion Bridge Models via Learnable Sample-specific Signatures [88.63093209858387]
  We propose GoodDiffusion, inspired by backdoor mechanisms, to enforce model-level use-time control.<n>GoodDiffusion preserves high-quality generation for authorized queries carrying valid signatures, yet refuses to generate for unauthorized inputs.<n>To strengthen security, we introduce a Learnable Signature Network (LSN) that assigns sample-specific signatures conditioned on each input.
  arXiv  Detail & Related papers  (2026-06-29T04:07:09Z)
• Privacy-Preserving Compliance on Public Ledgers via Selective Disclosure Authorization Schemes [9.133320151595084]
  We develop a cryptographic primitive for granular and revocable compliance checks on public ledgers without revealing the underlying witness.<n>We implement the sender-binding component using a 14-constraint Circom circuit that anchors the zero-knowledge proof to the executing on-chain address.<n>Our Sepolia evaluation confirms practical viability: browser-based proof generation executes in under 200 ms, and on-chain verification costs 240,512 gas, neutralizing proof reuse by different callers while preserving strict attribute privacy.
  arXiv  Detail & Related papers  (2026-06-18T09:38:13Z)
• Write-Domain Separation and Non-Custodial Enforcement: A Structural Impossibility in Account-Based Ledgers, with a Commitment-Based Construction [0.0]
  We ask a structural question about ledger access control.<n>Can a protocol enforce the future disposition of an asset without taking custody and without requiring the owner's cooperation at enforcement time?<n>We formalize the target as Non-Custodial Enforced Encumbrance (NCEE), a four-property specification covering self-custody, transition restriction, irrevocability, and permissionless enforcement.
  arXiv  Detail & Related papers  (2026-05-02T02:59:55Z)
• GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts [52.51342355102833]
  Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers.<n>Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions.<n>We propose GoAT-X, a framework that shifts automated cross-chain smart contracts auditing from pattern matching toward systematic first-principles verification.
  arXiv  Detail & Related papers  (2026-04-27T11:34:21Z)
• MEV-ACE: Identity-Authenticated Fair Ordering for Proposer-Controlled MEV Mitigation [1.7429038786735553]
  Maximal Extractable Value, or MEV, remains a structural threat to blockchain fairness.<n>This paper presents MEV ACE, a fair ordering protocol for proposer controlled ordering MEV.<n>The protocol remains single slot in structure, requires no threshold decryption committee, and is compatible with post quantum signature schemes such as ML DSA 44.
  arXiv  Detail & Related papers  (2026-04-08T20:12:06Z)
• ACE Runtime - A ZKP-Native Blockchain Runtime with Sub-Second Cryptographic Finality [1.7429038786735553]
  Existing high performance blockchains verify one signature per transaction on the critical path.<n>This paper presents ACE, a ZKP native execution layer built on identity authorization separation.
  arXiv  Detail & Related papers  (2026-03-10T21:39:36Z)
• ACE-GF-based Attestation Relay for PQC - Lightweight Mempool Propagation Without On-Path Proofs [1.7429038786735553]
  In post-quantum blockchain settings, objects that require validity proofs must be broadcast through mempool and relay networks.<n> STARKs have been proposed to aggregate such proofs so that each node forwards one proof per tick plus objects without proofs, capping per-node proof bandwidth at roughly 128 KB degree per tick.<n>We observe that propagation does not inherently require validity proofs on the path-only a lightweight assurance that an object is eligible for relay.<n>Only the builder (or final verifier) performs a single aggregated validity proof over the set of objects it includes.
  arXiv  Detail & Related papers  (2026-03-09T05:41:31Z)
• Condition-Triggered Cryptographic Asset Control via Dormant Authorization Paths [1.7429038786735553]
  Control of encrypted digital assets is traditionally equated with permanent possession of private keys.<n>We introduce Condition-Triggered Dormant Authorization Paths (CT-DAP)<n>CT-DAP is a cryptographic asset control method built on destructible authorization factors.
  arXiv  Detail & Related papers  (2026-03-09T03:57:06Z)
• Binding Agent ID: Unleashing the Power of AI Agents with accountability and credibility [46.323590135279126]
  BAID (Binding Agent ID) is a comprehensive identity infrastructure establishing verifiable user-code binding.<n>We implement and evaluate a complete prototype system, demonstrating the practical feasibility of blockchain-based identity management and zkVM-based authentication protocol.
  arXiv  Detail & Related papers  (2025-12-19T13:01:54Z)
• CSI-IBBS: Identity-Based Blind Signature using CSIDH [0.0]
  We propose an Identity-Based Blind Signature Scheme with an Honest Zero-Knowledge Verifier utilizing the CSIDH framework.<n>We analyze the security of the introduced protocol in the standard cryptographic model and demonstrate its effectiveness in safeguarding privacy and verifier honesty.<n>This work advances the creation of secure, and scalable cryptographic systems for the post-quantum era.
  arXiv  Detail & Related papers  (2025-09-07T16:31:16Z)
• 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)
• Towards Credential-based Device Registration in DApps for DePINs with ZKPs [46.08150780379237]
  We propose a credential-based device registration (CDR) mechanism that verifies device credentials on the blockchain. We present a general system model, and technically evaluate CDR using zkSNARKs with Groth16 and Marlin.
  arXiv  Detail & Related papers  (2024-06-27T09:50:10Z)
• SQIAsignHD: SQIsignHD Adaptor Signature [0.6708691048956046]
  We introduce $mathsfSQIAsignHD$, a new quantum-resistant adaptor signature scheme based on isogenies of supersingular elliptic curves.<n>We exploit the idea of the artificial orientation on the supersingular isogeny Diffie-Hellman key exchange protocol, SIDH, to define the underlying hard relation.
  arXiv  Detail & Related papers  (2024-04-13T15:25:28Z)
• Revocable Quantum Digital Signatures [57.25067425963082]
  We define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables a user to sign many messages. Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
  arXiv  Detail & Related papers  (2023-12-21T04:10:07Z)
• Combining Decentralized IDentifiers with Proof of Membership to Enable Trust in IoT Networks [44.99833362998488]
  The paper proposes and discusses an alternative (mutual) authentication process for IoT nodes under the same administration domain. The main idea is to combine the Decentralized IDentifier (DID)-based verification of private key ownership with the verification of a proof that the DID belongs to an evolving trusted set.
  arXiv  Detail & Related papers  (2023-10-12T09:33:50Z)
• FedSOV: Federated Model Secure Ownership Verification with Unforgeable Signature [60.99054146321459]
  Federated learning allows multiple parties to collaborate in learning a global model without revealing private data. We propose a cryptographic signature-based federated learning model ownership verification scheme named FedSOV.
  arXiv  Detail & Related papers  (2023-05-10T12:10:02Z)
• 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)

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.