ZK/SEC Research notes from zkSecurity
All series
Series

Lattice SNARKs

3 parts June 2025 – April 2026 52 min in total David Wong · Georgios Raikos
  1. Part 1

    Proofs On A Leash: Post-Quantum Lattice SNARK With Greyhound

    In this engaging blog post, we dive into the future of cryptography by exploring how lattice-based proof systems could fend off the quantum threat. We break down Greyhound, a promising lattice-based solution, explaining its transparent nature, efficient construction, and adaptability with today's systems. Along the way, you'll get a glimpse of key concepts like lattices, Ajtai commitments, and how Greyhound cleverly ensures security and efficiency. Whether you’re curious about the cutting-edge of cryptographic research or just want to understand the basics of quantum-resistant solutions, this post offers both depth and clarity.

    David Wong June 03, 2025 19 min Read →
  2. Part 2

    Playing with LaBRADOR: Building Compact Lattice-based Proofs with Recursion

    In this post, we explore LaBRADOR, a transparent, lattice-based proof system that achieves sublinear proof sizes through recursion. Built on the Module-SIS assumption, LaBRADOR lets a prover efficiently demonstrate knowledge of short vectors satisfying dot product constraints, general enough to express R1CS. The protocol’s key ideas include amortized openings, outer commitments, and a strategy to shrink the witness after each round of recursion. Together, these techniques make LaBRADOR a powerful, scalable framework for post-quantum zero-knowledge proofs.

    Georgios Raikos November 13, 2025 18 min Read →
  3. Part 3

    Soundness Failures in LaBRADOR Implementations from NTT -Friendly Rings

    Post-quantum cryptography is making its way into production libraries, and correct implementation is far from trivial. We reviewed several LaBRADOR implementations on GitHub and found three of them broken, with soundness collapsing as far as a single bit, because of parameter choices that look perfectly reasonable in many lattice-based protocols; a power-of-2 modulus, a composite modulus, or NTT-friendly rings for efficient ring multiplication. The post goes through how each of those choices undermines the protocol's soundness argument, and why NTT-friendliness, of all things, turns out to be the wrong instinct if not handled carefully.

    Georgios Raikos April 30, 2026 15 min Read →
Other series see all →
2 parts Variants of KZG April 2025 – July 2026 3 parts zkao February 2026 – July 2026 10 parts Proof is in the Pudding October 2024 – July 2026 3 parts AI meets Cryptography July 2026