Distributed key generation

From Wikipedia, the free encyclopedia

For some protocols no party should be in the sole possession of the secret key. Rather, during distributed key generation every party obtains a share of the key. A threshold of the participating parties need to cooperate in order to achieve a cryptographic task, such as decrypting a message.

In this sense distributed key generation is a logical preliminary step for doing threshold decryption without need for a trusted third party

There are different algorithms for different key types. Gennaro et al. introduced a secure protocol for discrete log-based systems in 1999 (online available at citeseer). Boneh and Franklin designed in 1997 a protocol for distributed RSA key generation for three or more parties (online available at Boneh's homepage). In 1999, a paper by Gilboa (online available at Gilboa's homepage) introduced two party distributed RSA key generation. An open source software for this protocol is available at Distrib-RSA Sourceforge Project.

v • d • e   Public-key cryptography Algorithms: CEILIDH | Cramer-Shoup | DH | DSA | ECDH | ECDSA | EKE | ElGamal encryption | ElGamal signature scheme | GMR | IES | Lamport | MQV | NTRUEncrypt | NTRUSign | Paillier | Rabin | RSA | Schnorr | SPEKE | SRP | XTR Theory: Discrete logarithm | Elliptic curve cryptography | RSA problem Standardization: ANS X9F1 | CRYPTREC | IEEE P1363 | NESSIE | NSA Suite B Misc: Digital signature | Fingerprint | PKI | Web of trust | Key size v • d • e   Cryptography History of cryptography | Cryptanalysis | Cryptography portal | Topics in cryptography Symmetric-key algorithm | Block cipher | Stream cipher | Public-key cryptography | Cryptographic hash function | Message authentication code | Random numbers | Steganography