Zero Knowledge cover image

Zero Knowledge

Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev

Jun 26, 2024
Alessandro Chiesa and Eylon Yogev discuss constructing cryptographic proofs from ideal hash functions, exploring SNARKs and Alessandro's role in ZK systems. They delve into superposition queries, limitations of the random oracle model, and future standardizations. The podcast highlights the importance of systematizing cryptographic proofs for security and efficiency.
01:10:47

Podcast summary created with Snipd AI

Quick takeaways

  • Constructing SNARKs from ideal hash functions offers a stable foundation for cryptographic proofs.
  • Michali construction is a foundational SNARK with meticulous analysis of its soundness and zero-knowledge properties.

Deep dives

Introduction to Hash-Based SNARKs

The book provides a detailed examination of constructing SNARKs from ideal hash functions, focusing on the stable landscape of hash-based SNARKs while addressing the challenges of recursive proofs.

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner