CRJun 18

Privacy-Preserving Compliance on Public Ledgers via Selective Disclosure Authorization Schemes

arXiv:2606.207602.2
Predicted impact top 92% in CR · last 90 daysOriginality Incremental advance
AI Analysis

For blockchain developers and regulators, this work provides a practical cryptographic primitive for granular, revocable compliance checks on public ledgers without sacrificing privacy.

The paper introduces Selective Disclosure Authorization Schemes (SDAS) to enable privacy-preserving compliance on public ledgers, addressing front-running and proof-reuse risks. The Ethereum-based instantiation, ZK-Compliance, achieves browser-based proof generation under 200 ms and on-chain verification at 240,512 gas, neutralizing proof reuse while preserving attribute privacy.

Public distributed ledgers enforce integrity through radical transparency, creating tension with data minimization principles required for regulatory compliance. While Zero-Knowledge Proofs (ZKPs) offer a theoretical privacy solution, existing constructions often overlook adversarial constraints in smart contract environments. Specifically, the asynchronous decoupling of off-chain proof generation from on-chain submission introduces front-running and proof-reuse risks in public mempools. In this work, we formalize Selective Disclosure Authorization Schemes (SDAS), a cryptographic primitive for granular and revocable compliance checks on public ledgers without revealing the underlying witness. We define a security model for SDAS, introducing Ledger-Bound Attribute Unlinkability and Context-Aware Sender Binding to capture how valid proofs remain bound to their intended authorization context. To validate sender binding, we present ZK-Compliance, an Ethereum-based instantiation that operationalizes a user-controlled "Grant, Verify, Revoke" lifecycle. We implement the sender-binding component using a 14-constraint Circom circuit that anchors the zero-knowledge proof to the executing on-chain sender address. 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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes