On Prover-Efficient Public-Coin Emulation of Interactive Proofs

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Paul G. Allen School via YouTube Direct link

In the general case: • Messages With Varying Likelihood

9 of 9

9 of 9

In the general case: • Messages With Varying Likelihood

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Automatically move to the next video in the Classroom when playback concludes

  1. 1 On Prover-Efficient Public-Coin Emulation of Interactive Proofs
  2. 2 Can We Transform Private-Coin Proofs To Public-Coin?
  3. 3 Main Theorem: Sufficient properties for efficient transformations
  4. 4 An application
  5. 5 Set Lower-Bound Protocol (Baba) Sets (0,1) with efficient membership test
  6. 6 Emulating General Interactive Proofs
  7. 7 Unknown Number of Equally Likely Messages
  8. 8 Set Lower-Bound Protocol For #Consistent Coins
  9. 9 In the general case: • Messages With Varying Likelihood

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.