FICS and FACS: fast IOPPs and accumulation via code-switching
From MaRDI portal
Cites work
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Accumulation without homomorphism
- Algebraic methods for interactive proof systems
- Blaze: fast SNARKs from interleaved RAA codes
- Fast Reed-Solomon interactive oracle proofs of proximity
- FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed–Solomon Codes
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Linear-size constant-query IOPs for delegating computation
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Proof-carrying data without succinct arguments
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Proving as fast as computing: succinct arguments with constant prover overhead
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- WHIR: Reed-Solomon proximity testing with super-fast verification
This page was built for publication: FICS and FACS: fast IOPPs and accumulation via code-switching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443647)