如果你重视零知识证明技术信息的实效性和信息源质量的意义，不想娱乐至死、短视投机、无关广告、推荐算法、劣币驱逐良币的泥沙裹挟迷失，请多支持我们（包括给予赞助支持），让这一汨清流继续流淌～
Highlights
Computer Scientists Combine Two ‘Beautiful’ Proof Methods
零知识证明，它可以让验证者者相信一个陈述是真的，而不透露它为什么是真的。概率可检查证明，它可以说服验证者证明的真实性，即使只看到原始内容的一小部分。Gur， Spooner 和 O'Connor 成功解决了所有计数问题的完美零知识 PCP 构造问题。更重要的是，这些 PCP 的验证过程也完全是非交互式的。
Three researchers have figured out how to craft a proof that spreads out information while keeping it perfectly secret.
What is Zero-Knowledge (like, actually)? w/ David Wong
在本模块中，Nicolas Mohnblatt 和 David Wong 将深入探讨 "零知识 "这一术语，并讨论这一特性的实际含义、何时使用（或不使用）以及某些系统需要具备哪些特征才能被视为真正的零知识。 然后，他们强调了不同类型的零知识--完美的、统计的和计算的，讨论了不诚实和诚实验证者之间的区别，以及自适应模型比非自适应模型更受青睐的问题。 此外，他们还探讨了从 KZG、Pedersen 和哈希等技术中生成隐藏承诺的方法，最后概述了 PLONK 的零知识分析。
In this module, Nicolas Mohnblatt and David Wong dig into the term “Zero Knowledge” and discuss what this property actually is, when it is being used (or not) and what characteristics some systems need in order to be considered truly ZK. They then highlight the different types of ZK — perfect, statistical, and computational –, discuss the distinction between dishonest and honest verifiers, and the preference for adaptive models over non-adaptive ones. Additionally, they explore methods for generating hiding commitments from techniques such as KZG, Pedersen, and hashes, and conclude with an overview of the zero-knowledge analysis of PLONK.
Updates
bitcoin-circle-stark 1.0.0
Papers
Rate-1 Zero-Knowledge Proofs from One-Way Functions
If you’d like to receive updates via email, click subscribe. Stay informed and never miss a post!
And our YouTube channel
-
原创
- 学分: 5
- 分类: Solidity
- 标签:
