Proofs, Arguments, and Zero-Knowledge读书笔记-- 2024年5月8日星期三（Day 3，P20-P28）

Proofs, Arguments, and Zero-Knowledge读书笔记
2024年5月8日星期三（Day 3，P20-P28）：
1.Lagrange basis polynomials:

2. Establishing uniqueness：
3. Specifying a polynomial via evaluations vs. coefficients：
举例：

Chapter 3 Definitions and Technical Preliminaries
3.1 Interactive Proofs：

1. Given a function f mapping { 0 , 1 } n \{0,1\}^n {0,1}n to a finite range Ra， k-message interactive proof system (IP) for $f$ consists of a probabilistic verifier algorithm $V$ running in time poly($n$) and a prescribed (“honest”) deterministic prover algorithm $P$. 注意：V是概率的（V发送的任何消息都可能依赖于输入消息序列和内部的随机性），P是确定的。
2. Definition 3.1. An interactive proof system $(V,P)$ is said to have completeness error $\delta c$ and soundness error $\delta s$ if the following two properties hold.Completeness：表示$V$有${\delta }_c$的概率错误的拒绝一个正确的声明，即对于真实的声明，总存在一个有效的证明使得验证者 V 能够被正确地说服。
   Soundness：表示$V$有${\delta }_s$的概率错误的接受一个错误的声明，即，对于任何错误的声明 $y\ne f(x)$，P不能生成令人信服的证明可以说服验证者 V 接受。注意：perfect completeness, meaning that ${\delta }_c=0$，即总能税负验证者接受一个正确的声明.
   这里的P是：computationally unbounded provers，
   Soundness是：statistical soundness or information-theoretic soundness。
   注：在实际应用中，可以通过重复执行交互证明来多次降低错误概率。例如，Soundness error of any IP or argument can also be generically reduced from ${\delta }_s$ to ${\delta }_s^k$ by repeating the protocol $\Theta (k)$ times in sequence and rejecting unless the verifier accepts in a majority of the repetitions.
   3.2 Argument Systems
3. Definition 3.2. An argument system（也被称为computationally sound proofs） for a function $f$ is an interactive proof for $f$ in which the soundness （即，computational soundness）condition is only required to hold against prover strategies that run in polynomial time.
   这里的P是：computationally bounded provers（运行在多项式时间内）
   注： Soundness是：computational soundness.