Jonathan Bootle, IBM Research
From 12:30 until 13:30
At Zoom: https://ethz.zoom.us/j/92189245457
For many cryptographic proofs and arguments, the burden of proof is on the prover. Computing proofs for large statements is a bottleneck, despite the fact that we know how to produce amazingly succinct proofs with incredibly fast verification times. Very few works can claim prover algorithms which are truly asymptotically optimal, so that the cost of proving that a computation was performed correctly is a constant times the cost of the computation itself. This talk will describe a new cryptographic argument which achieves this requirement, without foregoing succinct proofs or fast verification times, using the power of special families of error-correcting codes.
Join the Zoom meeting at 12:30 on Thursday, January 28th: https://ethz.zoom.us/j/92189245457