lecture19

# lecture19 - INTERACTIVE PROOFS CSci 5403 COMPLEXITY THEORY...

This preview shows pages 1–2. Sign up to view the full content.

1 COMPLEXITY THEORY CSci 5403 LECTURE XIX: INTERACTIVE PROOFS III INTERACTIVE PROOFS Definition. An interactive proof system has two players: Arbitrary Prover P : Σ * Σ * α 1 = V(x;r) α 2 = P(x, α 1 ) α k = P(x, α 1 , α 2 ,…, α k-1 ) α k+1 = accept/reject The conversation (V P)(x;r) is α 1 , α 2 ,…, α k+1 . α k-1 = V(x, α 1 , α 2 ,…, α k-2 ;r) We say that (V P)(x;r) has k rounds. (V P)(x;r) accepts if α k+1 = accept PPT Verifier V : accept, reject Σ * Σ * ˫ { } INTERACTIVE PROOFS Definition. (P,V) is an interactive proof system for L 1. x ˥ L ˰ Pr[V accepts x] 2/3 2. x L ˰ Pr[V accepts x] 1/3 Definition. L ˥ IP[k] if ˳ k(n)-round interactive proof system (P,V) for L and constant c such that ˲ x,r |(P V)(x;r)| |x| c Definition. IP = ˫ c IP[n c ] Definition. Pr[(P V)(x) accepts] = Pr r [(P V)(x;r) accepts] Pr[V accepts x] = max P Pr[(P V)(x) accepts] (Completeness) (Soundness) HOW POWERFUL IS IP? Theorem.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.

### Page1 / 3

lecture19 - INTERACTIVE PROOFS CSci 5403 COMPLEXITY THEORY...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online