The Pedersen DKG protocol is based on Feldman’s verifiable secret sharing (VSS) scheme, which is an extension of Shamir’s secret sharing scheme. The result is a (t, n)-Shamir’s secret sharing of a value that is unknown to all participants: each participant P i starts by generating a random polynomial p i (x) = a i,0 + a i,1 x + … + a i,t xt of degree t. She publishes the coefficient commitments (A i,0 = ga i,0 , A i,1 = ga i,1 , …, A i,t = ga i,t ) and then sends the secret share s i, j = p i (j) to P j . To obtain their secret share s j , each participant P j simply sums the secret shares obtained from the other participants.