Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
Zero Knowledge
Exploring Cryptographic Proofs from Hash Functions
The chapter delves into the intricacies of building cryptographic proofs from hash functions, discussing the evolution from Interactive Oracle Proofs to succinct non-interactive arguments. It explores the concept of 'snargs' and contrasts hash-based SNARKs with other types of SNARKs, emphasizing the importance of ideal hash functions for security. The chapter also highlights the significance of systematizing cryptographic proofs for long-term security and optimizing hash-based proving systems for efficiency.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
