Highlights

zkSNARKs in the ROM with Unconditional UC-Security

This paper proves that there exist zkSNARKs in the random oracle model (ROM) that unconditionally achieve UC-security.

  • https://eprint.iacr.org/2024/724

Relativized Succinct Arguments in the ROM Do Not Exist

This paper proves that relativized succinct arguments in the ROM do not exist. The impossibility holds even if the succinct argument is interactive, and even if soundness is computational (rather than statistical). Relativized SNARGs are a powerful primitive that, e.g., can be used to obtain constructions of IVC (incrementally-verifiable computation) and PCD (proof-carrying data) based on falsifiable cryptographic assumptions. This results rule out this approach for IVC and PCD in the ROM.

  • https://eprint.iacr.org/2024/728

Bain Capital Crypto Whiteboards

David Wong关于MPC (Multi-Party Computation) & Shamir Secret Sharing (SSS)的系列白板介绍视频。

  • https://www.youtube.com/playlist?list=PLRSMpO6IlBK1p3GMhbWEBmVfOFL-Fs4g1

Updates

DelphiusLab 发布 ZKWASM-Book

  • https://zkwasmdoc.gitbook.io/delphinus-zkwasm

Jolt 更新路线图

  • https://jolt.a16zcrypto.com/tasks.html

A proof-of-concept implementation of KiloNova

  • https://github.com/FranklinZty/KiloNova-poc

Noir v0.28.0

新的 min 和 max 函数简化了数值比较 新的 as_array 方法简化了从切片到数组的转换 新的 BarretenbergVerifier 类加速了证明验证，并支持验证密钥加载

  • 变更日志: https://github.com/noir-lang/noir/releases/tag/v0.28.0
  • 最新安装版本: https://noir-lang.org/docs/getting_started/installation/

Learning

图解 Lasso

看这个图能对 Lasso 有个框架的认识

  • 图: https://excalidraw.com/#json=rxe_CEVy9pKi1OO6YaUKr,uWoUBAq26lkKj1akg5FbRg
  • 对应的视频 https://www.youtube.com/watch?v=iDcXj9Vx3zY

为什么 Prover 不能在 Groth16 中作弊

这篇文章详细探讨了 Groth16 证明系统中的 Prover 为什么无法作弊，并且以一种与原始论文不同的方式证明了 Groth16 的 knowledge soundness 的性质。

  • https://hackmd.io/@chokermaxx/S1rh7EGeR

Notes on Collaborative zk-SNARKs

介绍 co-SNARKs。In Collaborative zk-SNARKs (co-SNARKs), the 3 parties , and each hold a piece of the secret data (secret witness ). They will then interact with each other into this MPC protocol to generate a single which is a zk-SNARK.

  • https://www.leku.blog/co-snarks/

Binyi Chen: LatticeFold - A Lattice-based Folding Scheme and Applications to Succinct Proof Systems

Binyi Chen 在 CMU Cylab Crypto Seminar 再次讲解 LatticeFold

  • https://www.youtube.com/watch?v=pre-nW3jawM

“Is Bandersnatch for Real?” by Antonio Sanso

presents a procedure to construct parameterized families of prime-order endomorphism-equipped elliptic curves that are defined over the scalar field of pairing-friendly elliptic curve families such as Barreto–Lynn–Scott (BLS), Barreto–Naehrig (BN) and Kachisa–Schaefer–Scott (KSS), providing general formulas derived from the curves’ seeds.

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

A summary on the FRI low degree test

Polygon Labs的Ulrich Haböck对 [BSBHR18a]、[BSCI+20] 和 [BSGKS20] 等文献中的FRI low degree test和DEEP algebraic linking等技术进行了非正式的总结。总结基于[BSCI+20]带来的最新的健全性分析，讨论了实际安全参数的设置，FRI如何转化为多项式承诺方案，以及列表解码机制中DEEP采样的健全性。这篇文章能够帮助初学者快速理解FRI相关的技术要点和安全性设置。

  • https://eprint.iacr.org/2022/1216