Zero Knowledge cover image

Zero Knowledge

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

Jun 26, 2024
01:10:38
Snipd AI
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.
Read more

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.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode