Highlights

Zero-knowledge proofs

作者团队发布了一段关于 zkp 的视频，并讨论了制作过程中的挑战。强调零知识证明在理论上简单而优雅，但实际上涉及许多复杂性。建议深入学习者阅读 Oded Goldreich 的经典密码学书籍：Foundations of Cryptography。

• https://vasekrozhon.wordpress.com/2025/03/17/zero-knowledge-proofs/

I can prove I’ve solved this Sudoku without revealing it

我可以说服你，我已经解决了数独问题，而无需向你透露任何有关我的解决方案的信息。我们讨论了如何使用密码学家所谓的零知识证明来实现这一点，以及如何将相同的技巧用于你能想到的几乎所有其他问题。

• https://www.youtube.com/watch?v=Otvcbw6k4eo

Quantum Speedup Found for Huge Class of Hard Problems

一直很难找到量子计算机能够比传统机器更快地回答的重要问题，但一种新算法似乎可以完成一些关键的优化任务。

• https://www.quantamagazine.org/quantum-speedup-found-for-huge-class-of-hard-problems-20250317/

ICICLE-Snark: The Fastest Groth16 Prover in the World

如题

• https://x.com/Ingo_zk/status/1902046398012408060

Transpiling a Halo2 circuit into CCS

文章介绍了 halo2-ccs+ —— 一个将 Halo2（Plonkish 证明系统）电路转换为 CCS（Customizable Constraint System） 的转译器（transpiler），并提供了 Poseidon 哈希函数的基准测试结果。

• https://ethresear.ch/t/transpiling-a-halo2-circuit-into-ccs/21963

Updates

Analysis of the Telegram Key Exchange

TL;DR

Telegram 的密钥交换协议提供了一定的安全性，但设计复杂且不标准，导致安全证明困难。使用 SHA-1、会话 ID 过短、缺乏密文完整性等问题，影响协议的安全性。某些安全性依赖于非标准假设，这可能导致协议在未来遭受攻击。

研究发现了一个潜在的会话绑定漏洞，Telegram 已修复，但仍然建议改进设计。建议 Telegram 采用更标准的密码学方法，如 SHA-256、KDF 和 AE 方案，以提高安全性。

• https://martinralbrecht.wordpress.com/2025/03/16/analysis-of-the-telegram-key-exchange/

The Future of Ethereum Scaling: Native Rollups Explained

本期对谈详细介绍了什么是 Native Rollups，它们如何利用以太坊的核心基础设施进行执行和验证，以及它们为何对增强安全性、提高可组合性和可持续的以太坊增长至关重要。

• https://x.com/BanklessHQ/status/1901604430480568604

Timelines for migration to post-quantum cryptography

适用对象：网络安全专业人士、大型组织、公共部门

该指南由英国国家网络安全中心（NCSC） 发布，旨在为英国政府、关键基础设施运营商、大型企业提供后量子密码学（PQC）迁移的时间表和建议，确保在量子计算威胁下的长期网络安全。

• https://www.ncsc.gov.uk/guidance/pqc-migration-timelines

zkSummit13

2025 年 5 月 12 日在多伦多举办。

• https://www.zksummit.com/

Papers

On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations

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

webSPDZ: Versatile MPC on the Web

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

Exploring General Cyclotomic Rings in Torus-Based Fully Homomorphic Encryption: Part I - Prime Power Instances

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

Tighter Concrete Security for the Simplest OT

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

SCAPEgoat: Side-channel Analysis Library

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

Ideal Compartmented Secret Sharing Scheme Based on the Chinese Remainder Theorem for Polynomial Rings

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

Scalable Zero-knowledge Proofs for Non-linear Functions in Machine Learning

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

VeriSSO: A Privacy-Preserving Legacy-Compatible Single Sign-On Protocol Using Verifiable Credentials

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

Server-Aided Anonymous Credentials

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

On Extractability of the KZG Family of Polynomial Commitment Schemes

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

Compressed Sigma Protocols: New Model and Aggregation Techniques

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

Don't Use It Twice: Reloaded! On the Lattice Isomorphism Group Action

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

Designated-Verifier SNARGs with One Group Element

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

Secret-Sharing Schemes for General Access Structures: An Introduction

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

Masking-Friendly Post-Quantum Signatures in the Threshold-Computation-in-the-Head Framework

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

Assembly optimised Curve25519 and Curve448 implementations for ARM Cortex-M4 and Cortex-M33

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

Ring Referral: Efficient Publicly Verifiable Ad hoc Credential Scheme with Issuer and Strong User Anonymity for Decentralized Identity and More

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

Deniable Secret Sharing

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

AI Agents in Cryptoland: Practical Attacks and No Silver Bullet

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