Secure Distributed Key Generation for Discrete-Log Based Cryptosystems

By Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin. 1999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, neutral): “[30]) allows a set of N parties to generate unbiased, random keys.”
Proofs-of-delay and randomness beacons in Ethereum (2017, background): “However, preventing malicious parties from selectively aborting the protocol (and hence manipulating the result) requires either provably verifiable secret-sharing techniques [16, 22] or financial penalties enforced by a programmable cryptocurrency to punish parties that abort [3].”
Bitter to Better - How to Make Bitcoin a Better Currency (2012, background): “A natural countermeasure to malware is to split private keys into random shares, using standard threshold cryptography techniques [11,13], and distribute them onto multiple locations, e.”
Scalable Bias-Resistant Distributed Randomness (2017, background): “[29] by adopting a point-of-no-return strategy implemented through the concept of a barrier, a specific point in the protocol execution after which the protocol always completes successfully, and by extending it to the asynchronous setting, where the adversary can break timing assumptions [14], [15]”
A survey on peer-to-peer key management for mobile ad hoc networks (2007, methodology): “Integration of the distributed key generation scheme [Gennaro et al. 1999] into the setup algorithm of the identitybased signature scheme [Cha and Cheon 2003] will enable the generation of a distributed master private key.”
Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019, background): “When the user manages his own wallet, some solutions against malware attacks that may compromise his device consists on threshold cryptography [79], where the user partitions the private keys in shares stored in multiple locations, such that if one share is stolen or compromised, the keys are”
Distributed Paillier Cryptosystem without Trusted Dealer (2010, methodology): “The DKG protocol (e.g., [33, 27 ]) for discrete-log based cryptosystems (e.g.,”
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (2012, methodology): “Prior to this work, solutions for distributed discrete log-based key generation systems [38], and threshold encryption/decryption for RSA [39,62], DSS [37] and Paillier [6,23,34] in the multiparty setting, have been presented.”
Short Signatures from the Weil Pairing (2001, background): “[26], which is a modification of a protocol due to Pedersen [46].”
Secure threshold multi authority attribute based encryption without a central authority (2008, methodology): “The secrecy [7] of DKG protocol could be defined as: no information on the secret σ can be learned by a (t, n)-threshold static adversary which corrupts at most t players except for what’s implied by the value y = gσ mod p.”
Dining Cryptographers Revisited (2004, background): “(In practice, it may be instantiated by means of a distributed protocol; see [16] for an example of such a protocol and a discussion of the underlying security guarantees.”
An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks Without Pairings (2016, methodology): “protect the master secret key s (or α), we can use techniques of threshold cryptography [41], [42] to distribute the master secret key s (or α) by storing them among different PKGs (TRAs).”