Highlights
Optimizing Montgomery Multiplication in WebAssembly
这篇文章探讨了如何在 WebAssembly 中优化 Montgomery 乘法以加速密码学操作，比较了 Mitscha-Baude 方法和 Emmart 方法等最新技术，展示了性能基准并提出了未来在零知识证明加速方面的研究方向。
The article explores optimizing Montgomery multiplication in WebAssembly for faster cryptographic operations, comparing state-of-the-art methods, including Mitscha-Baude's and Emmart's, highlighting performance benchmarks and future directions for zero-knowledge proof acceleration.
Chosen-Instance Attack
文章解释了「chosen-instance attacks」（选择实例攻击），即攻击者通过利用缺乏零知识属性的证明系统，通过多次证明插值见证多项式来提取私有输入。
This article explains "chosen-instance attacks," where adversaries exploit proof systems lacking zero-knowledge to extract private inputs by interpolating witness polynomials across multiple proofs.
ZODA: An Explainer
ZODA（零开销数据可用性）通过利用随机化和纠错码高效验证正确性，以最低开销提升区块链的可扩展性。
ZODA (Zero-Overhead Data Availability) enhances blockchain scalability by ensuring data availability with minimal overhead, using randomization and error-correcting codes to verify correctness efficiently.
zeam - Zig Beam Client
Zeam 是一个基于 Zig 的客户端，用于支持以太坊最新提出的 Beam Chain，这是一种 ZK 以太坊共识协议，旨在扩展和使以太坊去中心化。它支持开放开发、ZK-VM 集成。
Zeam is a Zig-based client for Beam Chain, a future ZK-powered Ethereum consensus protocol aiming to scale and decentralize Ethereum. It supports open development, ZK-VM integration.
World-leaders in Cryptography: Vadim Lyubashevsky
Vadim Lyubashevsky 是苏黎世 IBM 欧洲研究中心的密码学家，他的核心研究重点是基于格的方法，尤其是在实用格加密、数字签名和隐私保护原语领域。他与 Chris Peiker 和 Oded Regev（LWE 的发明者）一起发表了一篇经典论文，题为「论理想格和环上的误差学习」，该论文已被用作后量子密码学中格方法的基础。
Vadim Lyubashevsky is a cryptographer at IBM Research Europe in Zurich.His core research focus is around lattice-based methods, and especially in areas of practical lattice encryption, digital signatures and privacy-preserving primitives. Along with Chris Peiker and Oded Regev (the inventor of LWE), he published a classic paper entitled "On ideal lattices and learning with errors over rings", which has been used as a foundation for lattice methods within post-quantum cryptography.
Reading Alan Turing - Avi Wigderson
概要：讨论图灵的一些知名和鲜为人知的论文，举例说明他提出的深刻、有先见之明的思想的范围，并提及理论 CS 社区对这些思想的后续工作。
Overview: Discussing some well-known and less-known papers of Turing, exemplify the scope of deep, prescient ideas he put forth, and mention follow-up work on these by the Theoretical CS community.
Avi Wigderson's Turing award biography
对 2023 年图灵奖获得者 Avi Wigderson 的个人介绍，重点总结了他的教育背景、职业经历、主要研究贡献（如随机性、复杂性理论和密码学），以及他在理论计算机科学领域的领导地位和获得的荣誉。
Avi Wigderson, 2023 Turing Award laureate, is honored for foundational contributions to computational theory, including randomness, cryptography, and complexity, and for his intellectual leadership in theoretical computer science.
Updates
Torus-acceleration for multiexponentiation on GT
ZK Accelerate Bangkok: Videos, Photos & Recap
Noir 1.0 Pre-Release is live
Papers
A Comprehensive Review of Post-Quantum Cryptography: Challenges and Advances
LiLAC: Linear Prover, Logarithmic Verifier and Field-agnostic Multilinear Polynomial Commitment Scheme
One-More Unforgeability for Multi- and Threshold Signatures
A Complete Characterization of One-More Assumptions In the Algebraic Group Model
Worst-Case Lattice Sampler with Truncated Gadgets and Applications
MultiReg-FE: Registered FE for Unbounded Inner-Product and Attribute-Weighted Sums
Proof of Time: A Method for Verifiable Temporal Commitments Without Timestamp Disclosure
Lova: Lattice-Based Folding Scheme from Unstructured Lattices
Efficient Succinct Zero-Knowledge Arguments in the CL Framework
Scribe: Low-memory SNARKs via Read-Write Streaming
RoK, Paper, SISsors – Toolkit for Lattice-based Succinct Arguments
If you’d like to receive updates via email, click subscribe button blow.
