Unbiasable randomness with O(n^2) network overhead, safety under 34% honest and liveness under 67% honeset without BLS signatures and VDFs

[AlexAtNear]

@JustinDrake pointed out offline that he published something that has the same properties last year:

Leaderless k-of-n random beacon

TLDR: We suggest a random beacon scheme where committees of size n generate random numbers if k participants participate correctly. It is in a similar vein to Dfinity’s random beacon (without use of BLS) and has the same message complexity of k messages per beacon output. Part 1: A single random output For clarity we first show how k-of-n participants generate a single output in three phases. In part 2 we combine the phases for messaging efficiency. Phase 1—ephemeral identities: Every parti…