Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

IEEE Symposium on Security and Privacy via YouTube Direct link

Intro

1 of 13

1 of 13

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

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

  1. 1 Intro
  2. 2 Zero Knowledge Proofs(ZKP)[GMR 85]
  3. 3 Efficiency measures of ZKP
  4. 4 Applications of ZKP
  5. 5 Doubly Efficient Interactive Proof GKR08
  6. 6 GKR Protocol with Polynomial Delegation ZGK+17
  7. 7 Follow up work of [ZGK+17]
  8. 8 Our contributions: Transparent Polynomial Delegation
  9. 9 Our constructions
  10. 10 Our contributions: Transparent ZKVPD
  11. 11 Application: verifiable secret sharing
  12. 12 Compare Virgo with other transparent ZKP systems Proving Merkle tree roots with 256 leaves/511 SHA-256
  13. 13 Summary

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.