Techniques. A \((t,n)\) -secret sharing [1]} scheme allows a process during the generation and commitment phase to share a secret \(s\)  with \(n\)  other processes where any subset of size \(t\)  among them might retrieve the original secret \(s\) . In this way, even if a process refuses to disclose the original secret it has committed, the correct processes present in the system can still reconstruct it in the reveal phase by using the shares they were provided. Moreover, the values cannot be accessed too early as the number of shares held by the Byzantine processes does not surpass \(t\) . It is also often useful in these systems to use multi-signature schemes or threshold signature schemes, such as Schnorr [2]} or BLS [3]} to indicate that a number of processes surpassing the threshold defined in the system agree with a certain value.
