Completed
Extending Rounds (PT)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Probabilistic Termination and Composability of Cryptographic Protocols
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Motivation (2)
- 3 Communication Models
- 4 Deterministic BA/Broadcast Protocols
- 5 Randomized BA/Broadcast Protocols
- 6 What's Missing?
- 7 Canonical Synchronous Functionality (CSF)
- 8 CSF Examples
- 9 Synchronous Normal Form (SNF)
- 10 Extending Rounds (PT)
- 11 Sequential Composition (2)
- 12 Non-Simultaneous Start
- 13 Slack Reduction
- 14 Composition Theorem (Illustrated)
- 15 Summary
