  Multi-party random number generation is a key building-block in many
practical protocols. While straightforward to solve when all parties are
trusted to behave correctly, the problem becomes much more difficult in the
presence of faults. In this context, this paper presents RandSolomon, a
protocol that allows a network of N processes to produce an unpredictable
common random number among the non-faulty of them. We provide optimal
resilience for partially-synchronous systems where less than a third of the
participants might behave arbitrarily and, contrary to many solutions, we do
not require at any point faulty-processes to be responsive.
