Welcome to the resource topic for 2023/1094
Title:
Round Optimal Robust Distributed Key Generation
Authors: Jonathan Katz
Abstract:Protocols for distributed key generation (DKG) in the discrete-logarithm setting have received a tremendous amount of attention in the past few years. Several synchronous DKG protocols have been proposed, but most such protocols are either not fully secure (in the sense of simulatability) or are not robust in that they allow even a single malicious party to prevent successful generation of a key.
In this paper we explore the round complexity of (robust) DKG in the honest-majority setting where robust DKG is feasible. On the negative side, we show the impossibility of one-round (robust) DKG protocols regardless of any prior setup the parties have. On the positive side, we show various two-round—and hence, round-optimal—protocols for robust DKG offering tradeoffs in terms of their efficiency, necessary setup, and required assumptions.
ePrint: https://eprint.iacr.org/2023/1094
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .