AI summary by TwinMind
Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1
MIT OpenCourseWare
1h 31m 16s
Course Introduction and Logistics
- Advanced cryptography class focused on evolution of proofs in computer science from mid-80s to present
- Weekly meetings 1-4 PM, 11 total classes including guest lecture by Odv on October 6
- Requirements:
- Scribe notes for classes (can work in pairs)
- One problem set mid-course
- Pre-class reading recommended (Justin Taylor survey on proof systems)
- Cross-registered students have access to Canvas website
Evolution from Classical to Interactive Proofs
- Traditional proofs: line-by-line verification, deterministic
- Mid-80s shift driven by zero-knowledge proof goals (Goldwasser, Micali, Rackoff ~1985)
- Interactive proofs introduced two key changes:
- Interaction between prover and verifier
- Randomization in verification process
- Without randomization, interaction becomes useless (prover could predict all questions)
- MA (Merlin-Arthur) class: non-interactive randomized proofs, potentially more powerful than NP
Matrix Multiplication Verification Example
- Problem: verify C = A × B for n×n matrices over finite field
- Classical approach: O(n^2.36) time
- Randomized approach: O(n²) time
- Algorithm:
- Choose random r in field
- Create vector X = [1, r, r², ..., r^(n-1)]
- Check if C × X^T = A × (B × X^T)
- Soundness: if C ≠ A×B, probability of false acceptance ≤ (n-1)/|F|
- Based on polynomial interpolation: two distinct degree-(n-1) polynomials agree on at most n-1 points
Interactive Proof System Definition
- Protocol between potentially all-powerful prover P and polynomial-time verifier V
- For language L with completeness parameter C and soundness parameter S:
- Completeness: if x ∈ L, Pr[V accepts] ≥ C
- Soundness: if x ∉ L, for any cheating prover P*, Pr[V accepts] ≤ S
- Standard parameters: C = 2/3, S = 1/3
- Gap amplification through repetition using Chernoff bounds
- Shamir's theorem (1992): IP = PSPACE
Sum-Check Protocol
- Most important protocol in proof systems literature
- Problem: prove Σ_{h₁,...,hₘ ∈ H} f(h₁,...,hₘ) = β
- f is degree-D polynomial in each variable over finite field F
- Protocol structure:
- Round 1: Prover sends G₁(X) = Σ_{h₂,...,hₘ} f(X,h₂,...,hₘ)
- Verifier checks: degree ≤ D, Σ_{h∈H} G₁(h) = β
- Verifier sends random T₁
- Subsequent rounds: reduce dimension by fixing one variable at random point
- Final check: evaluate f at random point (T₁,...,Tₘ)
Protocol Analysis
- Communication complexity: O(M·D) field elements
- Verifier runtime: O(M·D·|H|) + polynomial log factors
- Prover runtime: O(|H|^M · T_f) where T_f is time to compute f
- Completeness: 1 (perfect completeness)
- Soundness error: ≤ M·D/|F|
- Key insight: soundness independent of |H|
- Cheating requires transition from false to true polynomial
- Probability of successful cheat per round: D/|F| (polynomial agreement lemma)
- Union bound over M rounds gives total error bound
Polynomial Properties and Applications
- Error correction properties: if polynomials differ, they disagree almost everywhere
- Low-degree extension technique: embed problems into polynomial form
- Sum-check enables interactive proofs for all PSPACE problems
- Foundation for doubly-efficient interactive proofs, PCPs, and modern proof systems
