Related Work.
When designing a BFT-RNG algorithm there are two main challenges: (i) how to manage the access to data, so to prevent Byzantine processes from accessing the result beforehand in the generation and commitment phase
while preventing them to halt the protocol by omitting; and (ii) how to compute correct results despite the Byzantine processes displaying commission faults. Existing protocols solve the first challenge by using techniques such as secret sharing [1]}, verifiable delay functions [2]}, threshold signatures [3]}[4]}, and fully homomorphic encryption [5]} and the second by requiring a verifiable proof that a shared data was generated correctly.
