import "github.com/bytemare/dkg"
Package dkg provides an efficient distributed key generation system in Go, easy to use. It builds on the 2-round Pederson DGK and extends it with zero-knowledge proofs to protect against rogue-key attacks of Byzantine participants, as defined in FROST. This is secure for any t among n participants in a (t,n)-threshold scheme.
This effectively generates keys among participants without the need of a trusted dealer or third-party. These keys are generally valid keys, and can be used in FROST and OPRFs.
- Pederson introduced the first DKG protocol, based on Feldman's Verifiable Secret Sharing.
- Komlo & Goldberg add zero-knowledge proofs to the Ped-DKG.
You can find the documentation and usage examples in the package doc.
- All parties are identified with unique IDs.
- Communicate over confidential, authenticated, and secure channels.
- All participants honestly follow the protocol (they can, nevertheless, identify the misbehaving participant).
Use the same ciphersuite for the DKG setup and the key usage in other protocol executions.
In case of an identified misbehaving participant, abort the protocol immediately. If this happens there might be a serious problem that must be investigated. One may re-run the protocol after excluding that participant and solving the problem.
The following steps describe how to run the DKG among participants. Note that participants maintain a state between phases. For each participant:
- Run Init()
- this returns a round 1 package
- send/broadcast this package to every other participant (this might include the very same participant, in which case it will discard it)
- Collect all the round 1 packages from other participants
- Run Continue() with the collection of round 1 packages
- this returns round 2 packages, one destined to each other participant
- each package specifies the intended receiver
- send it to the intended receiver
- Collect all round 2 packages destined to the participant
- Run Finalize() with the collected round 1 and round 2 packages
- returns the participant's own secret signing share, the corresponding verification/public share, and the group's public key
- Erase all intermediary values received and computed by the participants (including in their states)
- Optionally, compute the verification keys for each other participant and store them
SemVer is used for versioning. For the versions available, see the tags on the repository.
Please read CONTRIBUTING.md for details on the code of conduct, and the process for submitting pull requests.
This project is licensed under the MIT License - see the LICENSE file for details.