Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Aurora: transparent succinct arguments for R1CS
- Chainable functional commitments for unbounded-depth circuits
- Compact Proofs of Retrievability
- 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
- Fiat-Shamir: from practice to theory
- Fraud and data availability proofs: detecting invalid blocks in light clients
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Functional commitments for all functions, with transparent setup and from SIS
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Lattice-based blind signatures, revisited
- Linear-size constant-query IOPs for delegating computation
- Proofs of Retrievability via Hardness Amplification
- Scalable zero knowledge with no trusted setup
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Succinct vector, polynomial, and functional commitments from lattices
- The algebraic group model and its applications
This page was built for publication: FRIDA: data availability sampling from FRI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652989)
