DLOG + secure channels ⇒ DKG (GJKR)
Statement
Let output a group of prime order , and let be public with known to no party. The parties communicate synchronously over pairwise secure channels and a broadcast channel. In GJKR’s protocol, every shares a random with Pedersen’s verifiable secret sharing under , the set of qualified dealers is fixed, and only then does each dealer in broadcast for the coefficients of its sharing polynomial; the of a dealer whose broadcast values are inconsistent with its shares is reconstructed from its Pedersen shares. If DLOG is hard in , this protocol is a secure DKG, correct and secret, against a static malicious adversary corrupting any of the parties — GJKR99, GJKR07.