ZK Insights | 16th June 2024

Ronkathon: Learn Cryptography from First Principles

Ronkathon 是受 Plonkathon 启发的一组密码原语的 Rust 实现。旨在展示应用密码学的理论特性以及编程语言中的具体应用的技术内容。Ronkathon 是根据第一性原理构建的，因此无需了解外部库或详细依赖项（除 rand 和 itertools 之外）。大部分代码并未针对数学透明度和简洁性进行优化。

• https://pluto.xyz/blog/ronkathon-learn-cryptography-from-first-principles

A Zero Knowledge Paradigm: Part 2- Exploring zk-VM Design Trade-offs

In the part 2 of their article series about zkVMs, @ventalitan from @lita_xyz first gave an overview of zkVM design, and then covered the trade-offs of all the different aspects it involves.

在他们关于 zkVM 的文章系列的第 2 部分中，来自 @lita_xyz  的 @ventalitan 首先概述了 zkVM 的设计，然后讨论了它所涉及的各个方面的权衡。

• https://www.lita.foundation/blog/a-zero-knowledge-paradigm-part-2--exploring-zk-vm-design-trade-offs

Diving into Poseidon hash and its security 

• https://autoparallel.github.io/overview/index.html

The Nexus zkVM

• https://docs.nexus.xyz/

Polygon Zero zkEVM

A collection of libraries to prove Ethereum blocks with Polygon Zero Type 1 zkEVM, powered by starky and plonky2 proving systems.

一组使用 Polygon Zero Type 1 zkEVM 证明系统（由 starky 和 plonky2 提供支持）来证明以太坊区块的库。

• https://github.com/0xPolygonZero/zk_evm

How to verify ZK proofs on Bitcoin? by Polyhedra Network

• https://hackmd.io/@polyhedra/bitcoin

All the proof aggregation solutions will use RISC-V zkVMs

• https://blog.alignedlayer.com/all-the-proof-aggregation-solutions-will-use-risc-v-zkvms/

Episode 327: Proof Aggregation with Shumo and Yi from NEBRA

In this week’s episode Anna chats with Shumo and Yi from NEBRA. They discuss the high price of putting ZKPs on-chain before diving into NEBRA’s proposed solution to mitigating this, their Universal Proof Aggregation product. They cover what it takes to incorporate extra pricing systems into NEBRA UPA as well as the benefits that these systems will bring, how developers are meant to interact with them, and future integrations to enable seamless cross-zkRollup applications. The group round off by discussing prover marketplaces, verification aggregation systems, and the design space that this all opens up.

在本周的节目中，Anna 与 NEBRA 的 Shumo 和 Yi 进行了交谈。他们讨论了将 ZKP 上链的高昂成本，然后深入探讨了 NEBRA 提出的缓解这一问题的解决方案，即他们的通用证明聚合产品。他们介绍了将额外定价系统集成到 NEBRA UPA 中所需的步骤，以及这些系统将带来的好处，开发者如何与这些系统交互，以及未来的集成如何实现无缝的跨 zkRollup 应用。小组最后讨论了证明者市场、验证聚合系统，以及这一切所开辟的设计空间。

• https://zeroknowledge.fm/327-2/

Pairings in Cryptography

Dan Boneh 介绍了 pairing 的原理和计算 pairing 的算法，还讲了相关的应用，比如可以利用 pairing 构建 BLS 签名和门限签名。这里很搞笑，说 pairing 的公式是法国数学家 Andre Weil 在二战期间的 2 年监狱服刑中搞出来的（因为拒绝当兵），之后他在自传中建议法国数学家都去监狱中待两年，因为确实很高产。

• https://youtu.be/8WDOpzxpnTE?si=Exjj-d5yK2LEQNMy

Cryptography and Privacy in Context | Ying Tong | Web3Privacy Now Berlin Meetup 2024

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

Zero Knowledge Security from OpenSense

A very nice and general introduction about Zero Knowledge Security. ZK Developers and auditors can level up their ZK auditing skills in this video.

关于零知识安全的非常好且通用的介绍。ZK 开发者和审计员可以通过这段视频提升他们的 ZK 审计技能。

• https://www.youtube.com/watch?v=Ypreb-PKF7o

Fancy cryptography in the wild

Curated list of deployments of fancy cryptography. Cryptography counts as fancy if it uses primitives beyond symmetric ciphers, (EC)DH as key agreement, digital signatures, public key encryption such as RSA-OAEP, or KEMs, or uses those primitives in unusual ways, especially if it relies on properties beyond IND-CCA2.

精心整理的高级密码学部署列表。如果某种密码学使用超出对称密码、(EC)DH 作为密钥协议、数字签名、公钥加密（如 RSA-OAEP）或 KEMs 的原语，或以不寻常的方式使用这些原语，尤其是依赖于超出 IND-CCA2 的属性，则被认为是高级密码学。

• https://github.com/fancy-cryptography/fancy-cryptography

Poseidon{2} for Noir

• https://blog.taceo.io/poseidon2-for-noir/

Verification of zkWasm in Coq

This repository previews a Coq development to formally verify the zkWasm zkVM.

• https://github.com/CertiKProject/zkwasm-fv

Catnet Bitcoin signet

Catnet is a custom Bitcoin signet with OP_CAT enabled, used to test implementation of Bitcoin Circle STARK Verifier.

Catnet 是一个启用了 OP_CAT 的自定义 Bitcoin signet，用于测试 Bitcoin Circle STARK 验证器的实现。

• https://github.com/Bitcoin-Wildlife-Sanctuary/catnet

David Wong - noname walkthrough

• https://www.youtube.com/watch?v=pQer-ua73Vo

Justin Thaler - Proofs, Arguments, and Zero-Knowledge - Week 1 

Justin Thaler在学习群组中对于自己名作 Proofs，Arguments， and Zero-Knowledge 一书的讲解，这是第一周的录像，还附有讲解时使用的笔记。

• https://www.youtube.com/watch?v=qQ7yIEJKCtE&list=PLTPK8HRi5qmlIBA7TDTO8hBOprAc1FIQv

• https://www.dropbox.com/scl/fi/3e0feorbpi1q5yiobswd3/Note-Jun-12-2024.pdf?rlkey=dclie5k2oveahjxn1m1113aau&e=1&dl=0

Ariel Gabizon - FFT's on the projective line and circle-STARKs

Ariel Gabizon gave a talk about how to enable fast FFTs over Fp when a large power of 2 divides 𝑝+1, which is the idea behind Circle STARK.

Ariel Gabizon 发表了一场关于如何在 𝑝+1 被一个大 2 的幂整除时启用快速 FFTs 的演讲，这是 Circle STARK 背后的理念。

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

How zkSharding Addresses the Blockchain Trilemma

=nil; Foundation 的博客，总结了当前使用零知识证明对区块链进行扩展的技术路线，强调了 zkSharding 作为水平扩容路线的优势。

• https://nil.foundation/blog/post/zkSharding_scaling

zkStudyClub - LatticeFold: Lattice Folding Schemes (Binyi Chen)

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

Polymath: Groth16 Is Not The Limit

Proposes a zk-SNARK Polymath for the Square Arithmetic Programming constraint system using the KZG polynomial commitment scheme.  Polymath has a shorter argument than Groth16.  At 192-bit security, Polymath's argument is nearly half the size, making it highly competitive for high-security future applications.

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

Leveled Fully-Homomorphic Signatures from Batch Arguments

We do not have homomorphic signatures with features such as multi-hop evaluation, context hiding, and fast amortized verification, while relying on standard falsifiable assumptions. In this work, we design homomorphic signatures satisfying all above properties. Constructing homomorphic signatures for polynomial-sized circuits from a variety of standard assumptions such as sub-exponential DDH, standard pairing-based assumptions, or learning with errors.

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

Security of Fixed-Weight Repetitions of Special-Sound Multi-Round Proofs

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

A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP

Constructing an adaptively-sound SNARG for NP in the CRS model from sub-exponentially-secure iO and sub-exponentially-secure one-way functions.

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

Scalable Collaborative zk-SNARK and Its Application to Efficient Proof Outsourcing

Extending the existing zk-SNARKs Libra (Crypto'19) and HyperPlonk (Eurocrypt'23) into scalable collaborative zk-SNARKs.

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

SmartZKCP: Towards Practical Data Exchange Marketplace Against Active Attacks

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

Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs

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

Communication Complexity vs Randomness Complexity in Interactive Proofs

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

SNARGs under LWE via Propositional Proofs

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