Probabilistic Termination and Composability of Cryptographic Protocols

Explore a 25-minute conference talk from Crypto 2016 that delves into the probabilistic termination and composability of cryptographic protocols. Learn about communication models, deterministic and randomized Byzantine Agreement/Broadcast protocols, and the concept of Canonical Synchronous Functionality (CSF). Discover the Synchronous Normal Form (SNF), examine techniques for extending rounds and sequential composition, and understand non-simultaneous start and slack reduction. Gain insights into the Composition Theorem through illustrations and conclude with a comprehensive summary of the presented concepts.