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 ac...
Keywords:
cryptographic protocols / game theory, leader election, multi-party computation, extractor, round complexity
