Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the intersection of error-correcting codes and SNARK (Succinct Non-Interactive Argument of Knowledge) systems in this one-hour conference talk. Learn how error-correcting codes contribute to building SNARKs with extremely efficient provers, reasonable verifier costs, and plausible post-quantum security properties that make them widely adopted in industry applications. Discover the specific families of error-correcting codes that yield efficient SNARK implementations and understand the core mathematical properties that enable this efficiency. Examine the critical tradeoffs between prover-friendly and verifier-friendly properties when selecting appropriate error-correcting codes for SNARK construction. Gain insights into how both prover and verifier computational costs depend heavily on the choice of underlying error-correcting code, and consider the ongoing research challenges and open questions in optimizing these cryptographic proof systems for practical deployment.
