Stanford Security Seminar

Elaine Shi

Abstract:

Suppose that n parties want to run a protocol to jointly toss a coin. It is well-known that when half of the parties can be corrupt, strong fairness is impossible, i.e., the corrupt coalition can always misbehave and bias the outcome. Inspired by blockchain applications, we ask, is it possible to achieve a *game theoretic* notion of fairness under corrupt majority? I will talk about how to formulate game theoretic security, the overall possibility/impossibility of game-theoretically secure coin toss and leader election in the presence of majority coalitions, as well as the round complexity.

Time and Place