Zero Knowledge Podcast Por Zero Knowledge Podcast arte de portada

Zero Knowledge

Zero Knowledge

De: Zero Knowledge Podcast
Escúchala gratis

Obtén 3 meses por US$0.99 al mes + $20 crédito Audible
Zero Knowledge is a podcast which goes deep into the tech that will power the emerging decentralised web and the community building this. Covering the latest in zero knowledge research and applications, the open web as well as future technologies and paradigms that promise to change the way we interact — and transact — with one another online. Zero Knowledge is hosted by Anna Rose Follow the show at @ZeroKnowledgefm (https://twitter.com/zeroknowledgefm) or @AnnaRRose (https://twitter.com/AnnaRRose) If you like the Zero Knowledge Podcast: Join us on Telegram (https://t.me/joinchat/TORo7aknkYNLHmCM) Support our Gitcoin Grant (https://gitcoin.co/grants/38/zero-knowledge-podcast) Support us on Patreon (https://www.patreon.com/zeroknowledge) Or directly here: ETH: 0x4BF66E52f3009Cd138e48f142D47661037160001 BTC: 1cafekGa3podM4fBxPSQc6RCEXQNTK8Zz ZEC: t1R2bujRF3Hzte9ALHpMJvY8t5kb9ut9SpQ DOT: 14zPzb7ihiBeaUn9jdPW9cHKGBd9qtTuJE75hhW2CvzLh6rT© 2025 Zeroknowledge Ciencia Matemáticas
Episodios
  • Lattices, Folding, & Symphony with Binyi Chen

    Lattices, Folding, & Symphony with Binyi Chen
    Nov 19 2025
    In this episode Anna Rose and Nico Mohnblatt chat with Binyi Chen, researcher at Stanford University. They discuss his work on lattice-based folding schemes, revisit LatticeFold and LatticeFold+, and cover how lattices enable low-cost, post-quantum-secure folding by replacing Pedersen hashes with Ajtai commitments. They discuss the early folding work from 2023 and how it has evolved and explore the advantages of lattices over other approaches in the folding context while also highlighting their tradeoffs. Binyi goes on to introduce Symphony, his new work that eliminates the need to implement Fiat-Shamir in the recursive verification circuit, and describes how that improves efficiency and removes the chances for a KRS-style attack. Related Links
    • Binyi Chen’s Website
    • LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems
    • LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
    • Symphony: Scalable SNARKs in the Random Oracle Model from Lattice-Based High-Arity Folding
    • Protostar: Generic Efficient Accumulation/Folding for Special-sound Protocols
    • ZK Whiteboard Sessions:SEASON 3 MODULE 3: Lattice-based SNARKs, w/ Vadim Lyubashevsky
    • ZK Whiteboard Sessions:SEASON 3 MODULE 4: LatticeFold, w/ Binyi Chen
    • Implementing LatticeFold with Matthew and Albert from Nethermind
    • Lattice-based ZK Systems with Vadim Lyubashevsky

    Further Reading
    • Generating Hard Instances of Lattice Problems by M. Ajtai
    • SWIFFT: A Modest Proposal for FFT Hashing
    • Delegating Computation: Interactive Proofs for Muggles
    • How to Prove False Statements: Practical Attacks...
    Más Menos
    1 h y 6 m
  • The Quest for Practical iO with Machina iO

    The Quest for Practical iO with Machina iO
    Nov 12 2025
    In this episode, Anna Rose and Tarun Chitra chat with Sora Suegami and Enrico Bottazzi from Machina iO. They explain indistinguishability obfuscation (iO) technology and how they are working to bring this powerful cryptographic primitive from theoretical territory into the practical world. They discuss how the pair got into iO and how new assumptions like all-product LWE and evasive LWE will help bridge theory to practice. They explore the benchmarks, the challenges and opportunities of this cutting-edge privacy cryptography and cover potential optimizations and real-world uses. While iO is still far from being truly practical, their work shows tangible steps ahead and offers interesting insights into how this could actually work. Related Links
    • Indistinguishability Obfuscation (iO) with Huijia (Rachel) Lin
    • Machina iO
    • Diamond iO: A Straightforward Construction of Indistinguishability Obfuscation from Lattices
    • Compact Pseudorandom Functional Encryption from Evasive LWE
    • Indistinguishability Obfuscation from Well-Founded Assumptions
    • Lookup-Table Evaluation over Key-Homomorphic Encodings and KP-ABE for Nonlinear Operations
    • Original BGG+ paper:Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits∗
    • Gentry’s classic thesis on FHE bootstrapping:A FULLY HOMOMORPHIC ENCRYPTION SCHEME
    • Gentry (GGH+) paper for obfuscation for all circuits:Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits

    • Optimal Broadcast Encryption and CP-ABE from Evasive Lattice Assumptions
    • Evasive LWE Assumptions: Definitions, Classes, and Counterexamples
    • Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin
    Más Menos
    1 h y 3 m
  • Countdown to Q-Day with Project 11

    Countdown to Q-Day with Project 11
    Nov 5 2025
    In this episode, Anna Rose chats with Alex Pruden and Conor Deegan from Project 11. They revisit the topic of quantum computing and explore the threat it poses to cryptographic systems like blockchains. As blockchain technology becomes increasingly integrated into global financial infrastructure — especially through stablecoins and banking rails — the stakes for quantum security continue to rise. Alex and Conor break down which algorithms are most at risk, why simple network upgrades won’t be enough, and what users will need to do to protect their own funds. They also outline potential mitigation strategies, including how Project 11 is approaching the challenge with post-quantum signature schemes, secure vaults, and a global namespace to coordinate user migrations ahead of “Q-Day.” The conversation also touched on how post-quantum thinking overlaps with zero-knowledge research, as hash- and lattice-based SNARKs offer resilience against future quantum attacks. Related links:
    • Project 11
    • Yellow Pages
    • PQC Suite B GitHub
    • Securing Sui in the Quantum Computing Era
    • Quantum resource estimation for large scale quantum algorithms: Section 5
    • Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
    • Downtime Required for Bitcoin Quantum-Safety

    ZK Podcast Previous Related Episodes on the topic:
    • Quantum Engineering with Jelena Vučković
    • Quantum Punks with Alex and Nicola
    • Quantum Cryptography Part 2 with Or Sattath

    ZK Whiteboard Sessions is an educational video series produced by ZK Hack in collaboration with Bain Capital Crypto. It is focused on the building blocks of zero knowledge technology. Find season 3 of the Whiteboard Sessions as well as previous seasons here.
    Más Menos
    1 h y 2 m
Todavía no hay opiniones