Ron Rothblum on Fiat-Shamir Attacks, Flock and SNARK.fast
Failed to add items
Sorry, we are unable to add the item because your shopping cart is already at capacity.
Add to basket failed.
Please try again later
Add to Wish List failed.
Please try again later
Remove from Wish List failed.
Please try again later
Follow podcast failed
Unfollow podcast failed
-
Narrated by:
-
By:
Summary
- Jagged Polynomial Commitments (or: How to Stack Multilinears)
- The Random Oracle Methodology, Revisited
- Blaze: Fast SNARKs from Interleaved RAA Codes
- TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes
- Flock: Fast Proving for Batch Boolean Computations
- VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems
- Bolt: Faster SNARKs from Sketched Codes
- zkGolf Website
- Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
- SNARK.fast Website
- ZK Podcast Episode: Error Correcting Codes & Information Theory with Ron Rothblum
- Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
- Delegating Computation: Interactive Proofs for Muggles
- How to Prove False Statements: Practical Attacks on Fiat-Shamir
**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 Telegram * Catch us on YouTube **Support the show:** * Patreon * ETH - Donation address * BTC - Donation address Read transcript
No reviews yet
In the spirit of reconciliation, Audible acknowledges the Traditional Custodians of country throughout Australia and their connections to land, sea and community. We pay our respect to their elders past and present and extend that respect to all Aboriginal and Torres Strait Islander peoples today.