Obtenez 3 mois à 0,99 $/mois

OFFRE D'UNE DURÉE LIMITÉE
Page de couverture de Zero Knowledge

Zero Knowledge

Zero Knowledge

Auteur(s): Zero Knowledge Podcast
Écouter gratuitement

À propos de cet audio

 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 Mathématique Science
Épisodes
  • Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More

    Pratyush Mishra on Tiny Proofs, Folding, Low-Memory SNARKs and More
    Nov 26 2025
    In this episode, Anna Rose and Nico Mohnblatt catch up with Pratyush Mishra, Assistant Professor of Computer and Information Science at the University of Pennsylvania. They discuss the various themes in his ZK research and some of the works he has been a part of in the last few years. They explore how Garuda and Pari achieve extremely small SNARK proofs, how Arc facilitates hash-based folding, proximity proofs with FICS and FACS, his work on low-memory SNARKs, and ZK applications outside the blockchain space. Pratyush shares how these ideas intersect with one another, from faster proving to smallest proof sizes to real-world uses. He also touches on his collaborations with other leading cryptographers like Benedikt Bünz and Alessandro Chiesa, and how ZK is finding its place in broader computer science. Related Links
      • Garuda and Pari: Faster and Smaller SNARKs via Equifficient Polynomial Commitments
      • Arc: Accumulation for Reed--Solomon Codes
      • FICS and FACS: Fast IOPPs and Accumulation via Code-Switching
      • Scribe: Low-memory SNARKs via Read-Write Streaming
      • Coral: Fast Succinct Non-Interactive Zero-Knowledge CFG Proofs
      • Hekaton: Horizontally-Scalable zkSNARKs via Proof Aggregation
      • Query-Optimal IOPPs for Linear-Time Encodable Codes
      • Time-Space Trade-Offs for Sumcheck
      • Blendy: A Time-Space Tradeoff for the Sumcheck Prover
      • Accumulation without Homomorphism
      • vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
      • Succinct Arguments in the Quantum Random Oracle Model
      • Lattices, Folding, & Symphony with Binyi Chen


    Aztec
    Voir plus Voir moins
    1 h et 2 min
  • 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...
    Voir plus Voir moins
    1 h et 6 min
  • 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 evasive LWE assumptions)
    Voir plus Voir moins
    1 h et 3 min
Pas encore de commentaire