Zero Knowledge

This week, host Anna Rose and Nico Mohnblatt chat with Ron Rothblum, Professor of Computer Science at Technion. They explore information theory and ZK, diving into the weeds on multiple topics including error correcting codes, FRI, FFTs, Reed-Solomon encoding, Fiat-Shamir and more. Here’s some additional links for this episode:Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge) by Holmgren, Lombardi and RothblumProving as Fast as Computing: Succinct Arguments with Constant Prover Overhead by Ron-Zewi and Rothblum Faster Sounder Succinct Arguments and IOPs by Holmgren and Rothblum The Random Oracle Methodology, Revisited by Canetti, Goldreich and Halevi Linear-Time Arguments with Sublinear Verification from Tensor Codes by Bootle, Chiesa and Groth Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup by Campanelli, Gailly, Gennaro, Jovanovic, Mihali and Thaler Reed-Solomon Codes Shannon’s Source Coding Theorem Guy Rothblum P