AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Episode 329: Building Cryptographic Proofs from Hash Functions with Alessandro Chiesa and Eylon Yogev
Zero Knowledge
Exploring Superposition Queries and Cryptographic Proofs
25min Snip
00:00
Summary
Transcript
Episode notes
The chapter covers superposition queries in the random oracle and quantum random oracle models, delving into adversaries' use of multiple queries with different amplitudes. It discusses cryptographic proofs utilizing random oracles, Merkle trees, SNARGS, and the Fiat-Chamir transformation, emphasizing security and efficiency trade-offs. The chapter also explores Merkle commitment schemes, Michali snarks, and the transition from interactive Oracle proofs to SNARKs, highlighting the need for precise definitions and parameter settings in cryptographic proofs.
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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