Block-accumulate codes: accelerated linear codes for PCGs and ZK
From MaRDI portal
Cites work
- Algebraic coding theory
- Aurora: transparent succinct arguments for R1CS
- Blaze: fast SNARKs from interleaved RAA codes
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Correlated pseudorandomness from expand-accumulate codes
- Efficient pseudorandom correlation generators for any finite field
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Expand-convolute codes for pseudorandom correlation generators from LPN
- Field-agnostic SNARKs from expand-accumulate codes
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Progress in Cryptology – Mycrypt 2005
- Query-optimal IOPPs for linear-time encodable codes
- Scalable zero knowledge with no trusted setup
- Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Stationary syndrome decoding for improved PCGs
- The Minimum Distance of Turbo-Like Codes
- TinyKeys: a new approach to efficient multi-party computation
This page was built for publication: Block-accumulate codes: accelerated linear codes for PCGs and ZK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443578)