FRIDA: data availability sampling from FRI
From MaRDI portal
Publication:6652989
DOI10.1007/978-3-031-68391-6_9MaRDI QIDQ6652989FDOQ6652989
Authors: Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner 
Publication date: 13 December 2024
Cites Work
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Compact Proofs of Retrievability
- Proofs of Retrievability via Hardness Amplification
- Dynamic proofs of retrievability via oblivious RAM
- The algebraic group model and its applications
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Interactive oracle proofs
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Constant-Size Commitments to Polynomials and Their Applications
- Succinct vector, polynomial, and functional commitments from lattices
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Lattice-based blind signatures, revisited
- Linear-size constant-query IOPs for delegating computation
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir: from practice to theory
- Title not available (Why is that?)
- Fraud and data availability proofs: detecting invalid blocks in light clients
- Functional commitments for all functions, with transparent setup and from SIS
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Chainable functional commitments for unbounded-depth circuits
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)
