Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, March 05, 2024, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Seth Pettie (University of Michigan)
One thing that distinguishes (theoretical) computer science from other disciplines is its full-throated support of a fundamentally adversarial view of the universe. Malicious adversaries, with unbounded computational advantages, attempt to foil our algorithms at every turn and destroy their quantitative guarantees. However, there is one strange exception to this world view and it is this: the algorithm must accept its input as sacrosanct, and may never simply reject its input as illegitimate. But what if some inputs really are illegitimate? Is building a "bullshit detector" for algorithms a good idea?
In this talk I will present a protocol for asynchronous Byzantine Agreement against the "strongest" adversary, which is omniscient, computationally unbounded, and can adaptively corrupt players as the protocol progresses. The protocol reduces Byzantine Agreement to a coin-flipping game in which the nominal goal is to collectively flip a fair coin, in the presence of malicious parties that attempt to fix its outcome. However, in the short term the malicious parties have an insurmountable advantage. The true goal of the game is to build a sound "bullshit detector" that identifies which parties are not playing according to protocol, and "blacklist" them.
https://arxiv.org/abs/2206.15335. J. ACM, 2024.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login