- Distributed key generation
-
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[1]. Boneh and Franklin designed in 1997 a protocol for distributed RSA key generation for three or more parties [2]. In 1999, a paper by Gilboa [3] introduced two party distributed RSA key generation. An open source software for this protocol is available at [4].
References
Public-key cryptography Algorithms Benaloh · Blum–Goldwasser · Cayley–Purser · CEILIDH · Cramer–Shoup · Damgård–Jurik · DH · DSA · EPOC · ECDH · ECDSA · EKE · ElGamal (encryption · signature scheme) · GMR · Goldwasser–Micali · HFE · IES · Lamport · McEliece · Merkle–Hellman · MQV · Naccache–Stern · NTRUEncrypt · NTRUSign · Paillier · Rabin · RSA · Okamoto–Uchiyama · Schnorr · Schmidt–Samoa · SPEKE · SRP · STS · Three-pass protocol · XTR
Theory Standardization ANS X9F1 · CRYPTREC · IEEE P1363 · NESSIE · NSA Suite B
Topics Digital signature · OAEP · Fingerprint · PKI · Web of trust · Key size
Cryptography Categories:- Cryptography stubs
- Asymmetric-key cryptosystems
Wikimedia Foundation. 2010.
