Episode
Quantum Advances, Hybrid Signatures and SNARKs to the Rescue with Dan Boneh
- Podcast
- Zero Knowledge
- Published
- May 6, 2026
- Duration seconds
- 5075
- Processing state
not_requested- Canonical source
- https://zeroknowledge.fm/podcast/400
Actions
POST https://stenobird.com/v1/public/podcasts/zero-knowledge-1048106/episodes/quantum-advances-hybrid-signatures-and-snarks-to-the-rescue-with-dan-boneh/transcription-requests
Idempotently request low-priority transcript generation for this episode.GET https://stenobird.com/podcast/zero-knowledge-1048106/quantum-advances-hybrid-signatures-and-snarks-to-the-rescue-with-dan-boneh.md
Read the agent-friendly Markdown representation of this episode resource.
Summary
In this 400th episode, Anna Rose welcomes back Dan Boneh , professor of computer science and electrical engineering at Stanford University, for a wide-ranging conversation on quantum computing, post-quantum cryptography, and the evolving role of ZK. They discuss Google's recent quantum algorithm announcement—what the paper actually showed, why it was proven in zero knowledge, and the cryptographic ideas embedded in the work. Dan shares his perspective on quantum timelines, the risks of rushing the post-quantum transition, and why algebraic signatures deserve more attention than hash-based ones in the blockchain world. The conversation covers hybrid signature schemes, the web's quiet transition to post-quantum cryptography, and the intersection of AI and ZK. Dan also highlights witness encryption, explains why encrypted mempools are generating new research questions, and closes with an update on the Ethereum Foundation's Proximity Prize. Related Links Episode 100 with Dan Boneh Episode 256 with Dan Boneh Episode 345 with Dan Boneh Episode 390 lean Ethereum Miniseries Kick-off with Anna & Nico Episode 359 Lattice-based ZK Systems with Vadim Lyubashevsky Episode 364 AI and ZK Auditing with David Wong Episode 382 Kevin Lacker on AI-Assisted Theorem Proving and Acorn Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes Oratomic (Neutral Atoms Startup) Proximity Prize The Trail of Bits Blog: We beat Google’s zero-knowledge proof of quantum cryptanalysis **If you like what we do:** * Find all our links here! @ZeroKnowledge | Linktree * Subscribe to our podcast newsletter * Follow us on Twitter @zeroknowledgefm * Join us on…