[Resource Topic] 2002/085: Efficient and Player-Optimal Strong Consensus

Welcome to the resource topic for 2002/085

Efficient and Player-Optimal Strong Consensus

Authors: Matthias Fitzi, Juan A. Garay


In the {\em strong consensus} problem,
n players attempt to reach agreement on a value initially held
by {\em one of the good players}, despite the (malicious) behavior
of up to t of them. Although the problem is closely related to the
standard consensus problem (aka Byzantine agreement),
the only known solution with the optimal number of players requires exponential
computation and communication in the unconditional setting.

In this paper we study this problem, and present {\em efficient} protocols
and tight lower bounds for several standard distributed computation models
— unconditional, computational, synchronous, and asynchronous.

ePrint: https://eprint.iacr.org/2002/085

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .