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.

翻译：多党随机数字生成是许多实际协议中的关键构件。 当各方相信行为正确时,问题就直截了当地解决,但问题却在有缺陷的情况下变得更加困难。在此背景下,本文件介绍了兰德索洛蒙(RandSolomon),这是一个允许N进程网络产生一个无法预测的共同随机数字的协议。我们为部分同步系统提供了最佳的复原力,在这些系统中,只有不到三分之一的参与者可能任意行事,而且与许多解决方案相反,我们并不要求任何错误过程作出反应。