eDAS: Extending Data Availability Sampling with Privacy and Compliance
Open Access
- 3 August 2026
- journal article
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Abstract
A data availability sampling scheme (DAS) allows a network of verifiers to collectively ensure that an untrusted party is correctly storing and distributing some committed data. Importantly, the protocol should not require that the verifiers coordinate or store the full data individually. In this paper, we initiate the study of privacy in DAS schemes: we ask whether the DAS guarantees can be upheld while keeping the committed data secret. We define a natural notion of zero-knowledge for DAS and show that no secure DAS scheme can satisfy this notion. In doing so, we motivate the need to study privacy-preserving variants of DAS. We define eDAS as DAS schemes over encrypted data and introduce the necessary security notions; namely, completeness, soundness and consistency. We additionally define a notion of privacy (zero-knowledge) and compliance (policy-enforcing). We then present two constructions of eDAS schemes. The first uses a DAS scheme as a black box and can be deployed on top of existing production-ready DAS systems with only minor modifications. The second is a more efficient construction that relies on the same principles but removes various layers of abstraction.Keywords
This publication has 10 references indexed in Scilit:
- Foundations of Data Availability SamplingIACR Communications in Cryptology, 2025
- FRIDA: Data Availability Sampling from FRI2024
- Verifiable Encryption from MPC-in-the-HeadIACR Communications in Cryptology, 2024
- A two-dimensional sharding model for access control and data privilege management of blockchainSimulation Modelling Practice and Theory, 2022
- Storing and Retrieving Secrets on a Blockchain2022
- Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients2021
- CALYPSOProceedings of the VLDB Endowment, 2020
- One-Shot Verifiable Encryption from Lattices2017
- Practical Verifiable Encryption and Decryption of Discrete Logarithms2003
- Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes2000