Highlights

Ethproofs

Ethproofs is the L2beat of zkVMs

Ethproofs 是 zkVM 的 L2beat

• https://ethproofs.org/

• https://x.com/eth_proofs/status/1883907113220739102

MIT 6.5630 Advanced Topics in Cryptography, Fall 2023

This course is about the evolution of proofs in computer science. We will learn about the power of interactive proofs, multi-prover interactive proofs, and probabilistically checkable proofs. We will then show how to use cryptography to convert these powerful proof systems into computationally sound non-interactive arguments (SNARGs).

本课程探讨计算机科学中证明形式的演化。我们将学习交互式证明、多证明者交互式证明以及概率可验证证明的强大之处。之后，我们将展示如何利用密码学将这些强大的证明系统转化为计算上可靠的非交互式论证（SNARGs）。

• https://www.youtube.com/playlist?list=PLUl4u3cNGP61EZllk7zwgvPbI4kbnKhWz

Blaze will be in Eurocrypt 2025

Blaze is a multilinear polynomial commitment with ultra-efficient proving over binary fields. A step towards 'real-time proving'

Blaze 是一种适用于二元域的多线性多项式承诺方案，具有超高效的证明生成能力。这是迈向「实时证明」的一步。

• https://x.com/benafisch/status/1885373722837536795

Updates

Announcing the Scroll Research Blog

• https://scroll.io/research/announcing-the-scroll-research-blog

Breaking Down the Puzzles in ZK Hack V

• https://www.zellic.io/blog/zellic-wins-two-puzzles-in-zkhack-v/

Papers

ACM CCS'24

• https://notes.kurtpan.com/ccs24

IEEE FOCS 2024

• https://notes.kurtpan.com/focs24

Post-Quantum Online/Offline Signatures

• https://eprint.iacr.org/2025/117

How to Prove False Statements: Practical Attacks on Fiat-Shamir

• https://eprint.iacr.org/2025/118

SoK: PQC PAKEs - Cryptographic Primitives, Design and Security

• https://eprint.iacr.org/2025/119

Module Learning with Errors with Truncated Matrices

• https://eprint.iacr.org/2025/120

Qelect: Lattice-based Single Secret Leader Election Made Practical

• https://eprint.iacr.org/2025/122

Falcon on ARM Cortex-M4: an Update

• https://eprint.iacr.org/2025/123

GPU Implementations of Three Different Key-Switching Methods for Homomorphic Encryption Schemes

• https://eprint.iacr.org/2025/124

Arbitrary-Threshold Fully Homomorphic Encryption with Lower Complexity

• https://arxiv.org/abs/2501.11235

Always by Your Side: Constructing Traceable Anonymous Credentials with Hardware-Binding

• https://eprint.iacr.org/2025/126

A Revision of CROSS Security: Proofs and Attacks for Multi-Round Fiat-Shamir Signatures

• https://eprint.iacr.org/2025/127

DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions

• https://eprint.iacr.org/2025/129

PRISM: Simple And Compact Identification and Signatures From Large Prime Degree Isogenies

• https://eprint.iacr.org/2025/135

Preprocessing Security in Multiple Idealized Models with Applications to Schnorr Signatures and PSEC-KEM

• https://eprint.iacr.org/2025/138

Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials

• https://eprint.iacr.org/2025/141

hax: Verifying Security-Critical Rust Software using Multiple Provers

• https://eprint.iacr.org/2025/142

KZH-Fold: Accountable Voting from Sublinear Accumulation

• https://eprint.iacr.org/2025/144

Practical Asynchronous Distributed Key Reconfiguration and Its Applications

• https://eprint.iacr.org/2025/149

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