Zero Knowledge

SummaryIn this week’s episode Anna and Nico chat with Alessandro Chiesa, Associate Professor at EPFL and Eylon Yogev, Professor at Bar-Ilan University. They discuss their recent publication; Building Cryptographic Proofs from Hash Functions, which provides a comprehensive and rigorous treatment of cryptographic proofs and goes on to analyze notable constructions of SNARGs based on ideal hash functions. Here’s some additional links for this episode:Building Cryptographic Proofs from Hash Functions by Chiesa and YogevEpisode 200: SNARK Research & Pedagogy with Alessandro ChiesaBarriers for Succinct Arguments in the Random Oracle Model by Chiesa and Eylon Yogev STIR: Reed–Solomon Proximity Testing with Fewer Queries by Arnon, Chiesa, Fenzi and Eylon Yogev ZK Podcast Episode 321: STIR with Gal Arnon & Giacomo Fenzi Computationally Sound Proofs by Micali Tight Security Bounds for Micali’s SNARGs by Chiesa and Yogev Interactive Oracle Proofs by Ben-Sasson, Chiesa, and Spooner Summer School on Probabilistic