Foundations of data availability sampling
From MaRDI portal
Cites work
- Coded Merkle tree: solving data availability attacks in blockchains
- Compact Proofs of Retrievability
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Dynamic proofs of retrievability via oblivious RAM
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fraud and data availability proofs: detecting invalid blocks in light clients
- FRIDA: data availability sampling from FRI
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- Impossibilities in succinct arguments: black-box extraction and more
- Interactive oracle proofs with constant rate and query complexity
- Ligero: lightweight sublinear arguments without a trusted setup
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- On the size of pairing-based non-interactive arguments
- Proofs of Retrievability via Hardness Amplification
- Rate-1, linear time and additively homomorphic UC commitments
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Separating succinct non-interactive arguments from all falsifiable assumptions
- The algebraic group model and its applications
- Vector commitments and their applications
- Zero-Knowledge Sets with Short Proofs
This page was built for publication: Foundations of data availability sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326446)
