Distributed Key Generation and Its Applications by Aniket Pundlik Kate A thesis presented to the University of Waterloo in ful llment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 2010 c Aniket Pundlik Kate 2010. Jul 04, 2012 Cryptology ePrint Archive: Report 2012/377. Distributed Key Generation in the Wild. Aniket Kate and Yizhou Huang and Ian Goldberg. Abstract: Distributed key generation (DKG) has been studied extensively in the cryptographic literature. However, it has never been examined outside of the synchronous setting, and the known DKG protocols cannot. Distributed generation is usually small-scale technologies including solar, wind and hydro used to produce electricity at, or close to, the end users of power and often by the end users of power. The government is interested in how distributed generation can help Alberta achieve its goal of 30 per cent of the province's electricity coming from. The economics and performance of power delivery. One key area of concern is the technical details of interconnecting distributed generation (DG) with the EPS. This report documents part of a multiyear research program dedicated to the development of requirements to support the definition, design, and demonstration of a DG-EPS interconnection.
Distributed key generation (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, distributed key generation does not rely on Trusted Third Parties.[1] Instead, the participation of a threshold of honest parties determines whether a key pair can be computed successfully.[2] Distributed key generation prevents single parties from having access to a private key. The involvement of many parties requires Distributed key generation to ensure secrecy in the presence of malicious contributions to the key calculation.[1]
Distributed Key Generation is commonly used to decrypt shared ciphertexts or create group digital signatures.[2]
Distributed key generation protocol was first specified by Torben Pedersen in 1991. This first model depended on the security of the Joint-Feldman Protocol for verifiable secret sharing during the secret sharing process.[3]
In 1999, Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin produced a series of security proofs demonstrating that Feldman verifiable secret sharing was vulnerable to malicious contributions to Pedersen's distributed key generator that would leak information about the shared private key.[4]Key generator for games free download. The same group also proposed an updated distributed key generation scheme preventing malicious contributions from impacting the value of the private key.
The distributed key generation protocol specified by Gennaro, Jarecki, Krawczyk, and Rabin assumes that a group of players has already been established by an honest party prior to the key generation. It also assumes the communication between parties is synchronous.[4]
In 2009, Aniket Kate and Ian Goldberg presented a Distributed key generation protocol suitable for use over the Internet.[5] Unlike earlier constructions, this protocol does not require a broadcast channel or the synchronous communication assumption, and a ready-to-use library is available.
Triple des key generator java. In many circumstances, a robust distributed key generator is necessary. Robust generator protocols can reconstruct public keys in order to remove malicious shares even if malicious parties still remain in the qualified group during the reconstruction phase.[4] For example, robust multi-party digital signatures can tolerate a number of malicious users roughly proportionate to the length of the modulus used during key generation.[6]
Distributed key generators can implement a sparse evaluation matrix in order to improve efficiency during verification stages. Sparse evaluation can improve run time from (where is the number of parties and is the threshold of malicious users) to . Instead of robust verification, sparse evaluation requires that a small set of the parties verify a small, randomly picked set of shares. This results in a small probability that the key generation will fail in the case that a large number of malicious shares are not chosen for verification.[7]
Distributed key generation and distributed key cryptography are rarely applied over the internet because of the reliance on synchronous communication.[4]
Distributed key cryptography is useful in key escrow services where a company can meet a threshold to decrypt a ciphertext version of private key. This way a company can require multiple employees to recover a private key without giving the escrow service a plaintext copy.[1]
Distributed key generation is also useful in server-side password authentication. If password hashes are stored on a single server, a breach in the server would result in all the password hashes being available for attackers to analyze offline. Variations of distributed key generation can authenticate user passwords across multiple servers and eliminate single points of failure.[8][9]
Distributed key generation is more commonly used for group digital signatures. This acts as a form of voting, where a threshold of group members would have to participate in order for the group to digitally sign a document.[2]