Highlights
Avi Wigderson Turing Award Lecture: “Alan Turing: A TCS Role Model”
阿维-维格德森 (Avi Wigderson) 获得了 2023 年 ACM A.M. 图灵奖，以表彰他对计算理论做出的奠基性贡献，包括重塑了我们对随机性在计算中的作用的理解，以及他数十年来在理论计算机科学领域的知识领导地位。 Wigderson 是新泽西州普林斯顿高等研究院数学学院的 Herbert H. Maass 教授。他在计算复杂性理论、算法与优化、随机性与密码学、并行与分布式计算、组合学、图论以及理论计算机科学与数学和科学之间的联系等领域一直处于领先地位。
Peter Shor is the recipient of the 2025 Claude E. Shannon Award
The IEEE Information Theory Society is pleased to announce that Peter Shor is the recipient of the 2025 Claude E. Shannon Award for consistent and profound contributions to the field of information theory.
To Schnorr and beyond
马修·格林是约翰霍普金斯大学的教授和密码学家，他在下面的两篇博客里面详细的介绍了 Schnorr 签名系统模型、协议和数学原理，博客清晰且重点清晰。
- https://blog.cryptographyengineering.com/2023/10/06/to-schnorr-and-beyond-part-1/
- https://blog.cryptographyengineering.com/2023/11/30/to-schnorr-and-beyond-part-2/
Fiat-Shamir Heuristic
Zkproof 工作小组关于 Fiat-Shamir Heuristic 的标准化草案，草案作者是 CNRS 的 M. Orrù。草案简洁的定义了Fiat-Shamir Heuristic的接口、步骤和示例。
Sigma Protocols
Network 工作小组关于 Sigma Protocols 的标准化草案，草案作者是 CNRS 的 M. Orrù 和 AIT 的 S. Krenn。草案状态是 Informational，已经包括了丰富的细节和示例。
Announcing AES-GEM (AES with Galois Extended Mode)
Interactive Arithmetization and Iterative Constraint Systems
David，zkSecurity的联合创始人，也是《真实世界的密码学》一书的作者关于交互式算术和迭代约束系统的总结博客，同时包含了一系列相关介绍的链接。
STIR won Best Paper at CRYPTO 2024!
Understanding the point at infinity in Elliptic Curves
“神秘”的密码学到底在学些什么？
The Phantom Zone
phantom-zone 是一个实验性的多方计算库，它使用多方完全同态加密来计算来自多方的私人输入的任意函数。目前，phantom-zone 的功能相当有限。它提供使用加密的 8 位无符号整数（称为 FheUint8）写入电路的功能，并且仅支持最多 8 方。FheUint8 支持与常规 uint8 相同的算法，介绍文档里面提到了一些例外情况。计划在未来将 API 扩展到其他有符号/无符号类型。
Privacy-preserving KYC
Proof of Twitter: ZK Email Demo
Hardhat ZKit
CryptoHack launched the ZKP section
Ethereum Proofs - Noir Library Use Cases
Blendy 🍹: a space-efficient sumcheck algorithm
Updates
ENCRYPT London 2024 (Playlist)
ZK and cryptography with Justin Thaler, Valeria Nikolaenko and Joseph Bonneau
The Man Who Solved the World’s Hardest Math Problem
The Zombie Misconception of Theoretical Computer Science
Privado ID
CUDA Mini Course #3, presented by Hadar Sackstein, Algorithms Engineer at Ingonyama
Now You Can Receive Crypto as Easily as an Email: The Mastermind Behind zkLogin - Kostas Kryptos
ETHGlobal Brussels (Video Playlist)
BOUNDLESS by RISC Zero at EthCC Brussels, Belgium 2024
- ZK Proofs in Action: Production-Ready Solutions for Real World Apps by Jeremy Bruestle
- Interoperability From Coordinated Sequencing & ZK Proofs by Ben Fisch, Espresso Labs
- https://www.youtube.com/watch?v=V3aIRUDp7eo&list=PLcPzhUaCxlCgCvzkkaBWzVuHdBRsTNxj1&index=43
- NEBRA UPA: Proof Aggregation for privacy, scaling and interoperability By Shumo Chu
- The Endgame for Web3 by Zac Williamson
Papers
【论文速递】CiC Vol. 1, Issue 2 (7篇）
【论文速递】ASIA CCS '24（隐私保护协议、后量子、密码学、去中心化系统、认证签名）
A Note on Efficient Computation of the Multilinear Extension
In this note we show how, given oracle access to and a point , to compute using field operations and only space.
Ringtail: Practical Two-Round Threshold Signatures from Learning with Errors
Introducing Ringtail, the most efficient 2-round lattice-based threshold signature from standard assumptions.
A Simple Post-Quantum Oblivious Transfer Protocol from Mod-LWR
Generic Anamorphic Encryption, Revisited: New Limitations and Constructions
Distributed Verifiable Random Function With Compact Proof
Jolt-b: recursion friendly Jolt with basefold commitment
Hadamard Product Argument from Lagrange-Based Univariate Polynomials
Learnings
STARK 101
STARK 101 is a hands-on tutorial on how to write a STARK prover from scratch (in Python).
Quantum Computer Programming in 100 Easy Lessons
A beginner's course on basic quantum computing algorithms. Background required: basic knowledge of computer programming, probability, and geometry. Knowledge of linear algebra a plus.