Tech●●●●●Difficulty 5 of 5

How can a group create a private key that no one ever sees?

Someone has to make the key, and whoever does knows it. Unless everyone makes a piece of it and nobody ever holds the whole.

▶ Start the story

Distributed key generation, or DKG, is a cryptographic process in which multiple parties contribute to the calculation of a shared public and private key set. Unlike most public key encryption models, it does not rely on a trusted third party. Instead, the participation of a threshold of honest parties determines whether a key pair can be computed. Crucially, it prevents any single party from having access to the private key.

Why bother? The alternative is a trusted dealer, who creates the key and hands out the shares. That dealer is trusted to generate good randomness, to delete secret values after distributing the shares, and to keep them confidential. Ordinary secret sharing simply assumes the dealer is honest. DKG is the other way to set up a group that signs together: a threshold signing group can be configured with a single trusted dealer, or by running a distributed key generation protocol.

How does it work? The protocols build on verifiable secret sharing, where extra information lets players check that their shares are consistent, so that even a dealer cannot leave the group without a well-defined secret. In the protocol of Gennaro, Jarecki, Krawczyk and Rabin, all parties share random polynomial functions this way. Every party then verifies the shares it received. If a share fails the check, the recipient broadcasts a complaint, and the accused party then broadcasts their shares. Accused parties can be , and the group computes its private key from every qualified party's contribution.

How a group makes a key nobody holds
  1. Step 1: Each party shares random values

    Using verifiable secret sharing

  2. Step 2: Everyone checks the shares received

  3. Step 3: Complaints are

    Accused parties their shares

  4. Step 4: Cheaters are

  5. Step 5: Key built from the qualified contributions

    No single party has access to it

The first protocol was specified by Torben Pedersen in 1991. In 1999, Gennaro and colleagues showed that it was vulnerable to contributions that would leak information about the shared private key, and proposed an updated scheme. Today DKG is commonly used to decrypt shared ciphertexts or create group digital signatures.

Quiz me

0/3

  1. 1.What does a distributed key generation protocol prevent?
  2. 2.Why does DKG build on verifiable secret sharing rather than plain secret sharing?
  3. 3.What did Gennaro, Jarecki, Krawczyk and Rabin show in 1999?

Recap

Everyone contributes, everyone checks, cheaters are disqualified, and the key is built from the honest contributions so nobody holds it whole.

💡 A trick to remember it · Many cooks, many pinches of salt: everyone adds their own, everyone tastes the pot, and no single cook knows the whole recipe.

Surprising fact · Pedersen's 1991 protocol was shown vulnerable in 1999 to malicious contributions that leak information about the key.

Sources (4)

No source, no claim. Every fact in this lesson (16 claims) cites at least one of these.

  1. [1]Distributed key generation · Wikipedia
  2. [2]RFC 9591: The Flexible Round-Optimized Schnorr Threshold (FROST) Protocol for Two-Round Schnorr Signatures · IETF / IRTF
  3. [3]Verifiable secret sharing · Wikipedia
  4. [4]Multi-Party Threshold Cryptography · NIST Computer Security Resource Center
More lessons in 💻 Tech (3) See all tech lessons →

One more light on your map.

Get one lesson like this every day, about the things you love. Free, in two or five minutes.

Get the share card for this lesson ↗