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

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

Explore a comprehensive analysis of adaptively secure full-information coin flip protocols in this 18-minute IEEE conference talk. Delve into the tight lower bound presented by Iftach Haitner and Yonatan Karidi-Heller from Tel Aviv University. Examine key concepts such as coin-flipping protocols, full-information coin flip, and adaptive adversaries. Investigate the expected outcome martingale, protocol jumps, and techniques for exploiting variance for biasing. Learn about attacking robust single-turn protocols and the challenges faced in non-robust protocols. Gain insights into the analysis, attack approach, and potential future works in this field of cryptography.