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 Proofs: Foundations and Frontiers of Probabilistic Proofs in Zürich, Switzerland Proofs, Arguments, and Zero-Knowledge by Thaler ZK HACK Discord and Justin Thaler Study ClubJustin Thaler Study Club by ZK HACK on YouTubeSubquadratic SNARGs in the Random Oracle Model by Chiesa and Yogev ZK Learning Course ZK Hack Montreal has been announced for Aug 9 - 11! Apply to join the hackathon here. Episode SponsorsLaunching soon, Namada is a proof-of-stake L1 blockchain focused on multichain, asset-agnostic privacy, via a unified shielded set. Namada is natively interoperable with fast-finality chains via IBC, and with Ethereum using a trust-minimized bridge.Follow Namada on Twitter

Ver todos los episodios