Highlights

Lattice-based ZK Systems with Vadim Lyubashevsky

Vadim shares the history and mathematical foundations of lattices, and explains how they might be used to build post-quantum secure ZK proofs and SNARKs. The conversation covers the unique challenges of adapting lattice techniques to zero-knowledge, explores the tradeoffs relative to hash-based constructions, and highlights the importance of developing quantum-safe standards for the future of cryptography.

Lattice-based ZK Explained

But what is quantum computing? (Grover's Algorithm)

https://deepwiki.com/

Updates

Introducing R0VM 2.0

First zk-rollup with Stage 1 confirmed: What it is and why it matters

World-leaders in Cryptography: Jonathan Katz

Implement a Fully Homomorphic Version of the AES-128 Cryptosystem using TFHE-rs

The Story of Information Theory

Papers

Universal Blind and Verifiable Delegated Quantum Computation with Classical Clients

Improved Rényi Arguments for Lattice-Based Threshold Encryption

FICS and FACS: Fast IOPPs and Accumulation via Code-Switching

Zemlyanika — Module-LWE based KEM with the power-of-two modulus, explicit rejection and revisited decapsulation failures

CoinMaze: Privacy-Focused CoinJoin Protocol for Bitcoin

GOLF: Unleashing GPU-Driven Acceleration for FALCON Post-Quantum Cryptography

LEAGAN: A Decentralized Version-Control Framework for Upgradeable Smart Contracts

DGSP: An Efficient Scalable Fully Dynamic Group Signature Scheme Using SPHINCS+

ZKPoG: Accelerating WitGen-Incorporated End-to-End Zero-Knowledge Proof on GPU

Unbiasable Verifiable Random Functions from Generic Assumptions

ALPACA: Anonymous Blocklisting with Constant-Sized Updatable Proofs

Incompleteness in Number-Theoretic Transforms: New Tradeoffs and Faster Lattice-Based Cryptographic Applications

ZHE: Efficient Zero-Knowledge Proofs for HE Evaluations

Publicly Auditable Garbled Circuit

Towards a Modern LLL Implementation

Clementine: A Collateral-Efficient, Trust-Minimized, and Scalable Bitcoin Bridge

Seamless Switching Between PBS and WoPBS for Scalable TFHE

Cryptography from Lossy Reductions: Towards OWFs from ETH, and Beyond

The Planted Orthogonal Vectors Problem


**If you’d like to receive updates via email, subscribe us!