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

• URL: http://arxiv.org/abs/2606.20760v1
• Date: Thu, 18 Jun 2026 09:38:13 GMT
• Title: Privacy-Preserving Compliance on Public Ledgers via Selective Disclosure Authorization Schemes
• Abstract summary: 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.
• Score: 9.133320151595084
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

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)
• Proof of Source of Funds: Efficient On-chain Provenance of Cryptoassets [5.222265639534245]
  We introduce Proof of Source of Funds (PoSoF), a novel cryptographic framework that shifts the burden to the user.<n>PoSoF provides verifiable cryptographic provenance; it guarantees the legitimacy of the funds without leaking the intermediate transaction topology.<n>Our benchmarks demonstrate that fully private, proactive compliance is highly practical.
  arXiv  Detail & Related papers  (2026-06-08T21:07:02Z)
• 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)
• Compiling Activation Steering into Weights via Null-Space Constraints for Stealthy Backdoors [48.881343993730844]
  Safety-aligned large language models (LLMs) are increasingly deployed in real-world pipelines.<n> adversaries can distribute backdoored checkpoints that behave normally under standard evaluation but jailbreak when a hidden trigger is present.<n>Recent post-hoc weight-editing methods offer an efficient approach to injecting such backdoors.
  arXiv  Detail & Related papers  (2026-04-14T06:48:33Z)
• Grant, Verify, Revoke: A User-Centric Pattern for Blockchain Compliance [9.133320151595084]
  Decentralized web applications face an inherent conflict between public verifiability and personal privacy.<n>We introduce a Selective Disclosure Framework designed to restore user sovereignty by decoupling eligibility verification from identity revelation.<n>Our evaluation shows that client-side proof generation takes under 200ms, enabling a seamless interactive experience on commodity hardware.
  arXiv  Detail & Related papers  (2026-03-16T17:06:44Z)
• ZK-ACE: Identity-Centric Zero-Knowledge Authorization for Post-Quantum Blockchain Systems [1.7429038786735553]
  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.
  arXiv  Detail & Related papers  (2026-03-09T05:21:44Z)
• RAIN: Secure and Robust Aggregation under Shuffle Model of Differential Privacy [46.52109845749167]
  We present Robust Aggregation in Noise (RAIN), a framework that reconciles privacy, robustness, and verifiability under Shuffle-DP.<n>RAIN adopts sign-space aggregation to robustly measure update consistency and limit malicious influence under noise and anonymization.<n>We show that RAIN maintains strong privacy guarantees under Shuffle-DP and remains robust to poisoning attacks with negligible degradation in accuracy and convergence.
  arXiv  Detail & Related papers  (2026-03-03T15:41:54Z)
• Poster: Privacy-Preserving Compliance Checks on Ethereum via Selective Disclosure [9.47737368469032]
  This work proposes a general Selective Disclosure Framework built on, designed to decouple attribute verification from identity revelation.<n>By utilizing client-side zk-SNARKs, the framework enables users to prove specific eligibility predicates without revealing underlying identity documents.<n>Preliminary results indicate that strict compliance requirements can be satisfied with negligible client-side latency.
  arXiv  Detail & Related papers  (2026-02-20T14:54:22Z)
• Privacy-Preserving On-chain Permissioning for KYC-Compliant Decentralized Applications [0.0]
  This paper presents a novel synthesis of Self-Sovereign Identity (SSI), Zero-Knowledge Proofs (ZKPs) and Attribute-Based Access Control.<n>We provide a comprehensive framework for permissioned dApps that aligns decentralized trust, privacy, and transparency, harmonizing blockchain principles with regulatory compliance.
  arXiv  Detail & Related papers  (2025-10-07T11:24:51Z)
• ZKPROV: A Zero-Knowledge Approach to Dataset Provenance for Large Language Models [46.71493672772134]
  We introduce ZKPROV, a novel cryptographic framework that enables zero-knowledge proofs of LLM provenance.<n>It allows users to verify that a model is trained on a reliable dataset without revealing sensitive information about it or its parameters.<n>Our method cryptographically binds a trained model to its authorized training dataset(s) through zero-knowledge proofs while avoiding proof of every training step.
  arXiv  Detail & Related papers  (2025-06-26T00:49:02Z)
• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [43.253676241213626]
  We propose an architecture for blockchain-based PAISs to preserve confidentiality and transparency.<n>Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.<n>We assess the security of our solution through a systematic threat model analysis and evaluate its practical feasibility.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• 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)
• 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.