A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Coin Flipping

1 of 15

1 of 15

Coin Flipping

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

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

  1. 1 Coin Flipping
  2. 2 Coin-Flipping Protocols [Blum '82]
  3. 3 Full-Information Coin Flip [Ben-Or and Linial 85]
  4. 4 Adaptive Adversaries
  5. 5 Our Result
  6. 6 Talk Outline
  7. 7 The Expected Outcome Martingale
  8. 8 Protocol Jumps - A Closer Look Fix n-party single-turn (n-round) protocol II, and try biasing it.
  9. 9 Exploiting Variance for Biasing
  10. 10 Attacking Robust (Single-Turn) Protocols Fix some small function (1), we will usually ignore it.
  11. 11 Analysis
  12. 12 Non-Robust Protocols
  13. 13 Main obstacles
  14. 14 Attack Approach
  15. 15 Summary, Future Works and Open Questions

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.