YACL Talk | Mar 28, 11:00am | Fatima Elsheimy, Yale - Early Stopping Byzantine Agreement

[Aviv Yaish]

We are excited to resume our seminar with a great talk by our very own Fatima Elsheimy!

• When: Friday (Mar 28), 11:00-noon
• Where: AKW200, Arthur K. Watson Hall, 51 Prospect St, New Haven, CT 06511, US
• Speaker: Fatima Elsheimy (Yale)
• Title: Early Stopping Byzantine Agreement
• Abstract: Early stopping agreement protocols ensure termination based on the actual number of malicious parties encountered during execution, $f \leq t$, rather than assuming the worst-case corruption bound of $t < n$. The fundamental lower bound on round complexity for such protocols is $\min{f+2, t+1}$ rounds. In this talk, I will provide a comprehensive overview of techniques for achieving early stopping in different settings: the information-theoretic setting, which tolerates up to $t < n/3$, and the authenticated setting, which tolerates up to $t < n/2$ and how it can be extended to tolerate $t < n$ corruptions. I will also discuss recent advancements in this area and highlight key open problems that remain unresolved.
• Livestream: https://yale.zoom.us/j/98568157789?pwd=crh9MncYfb8xHncO2oFn64Or5b3ePm.1 (Password: 355488, Telephone：203-432-9666 or 646 568 7788)
• More: For additional details about the talk, see our website: https://yacl.cs.yale.edu