Consider a set of synchronous entities connected in a complete graph. Show how the existence of both digital signatures and secrete sharing can be used to implement a global source of random bits unbiased and visible to all entities.