A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
DISC, pp. 34:1-34:16, 2018.
In 1985, Ben-Or and Linial (Advances in Computing Research u002789) introduced the collective coin-flipping problem, where n parties communicate via a single broadcast channel and wish to generate a common random bit in the presence of adaptive Byzantine corruptions. In this model, the adversary can decide to corrupt a party in the course...More
Full Text (Upload PDF)
PPT (Upload PPT)