International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Round-Optimal Fully Secure Distributed Key Generation

Authors:
Jonathan Katz , Google and University of Maryland
Download:
DOI: 10.1007/978-3-031-68394-7_10 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2024
Abstract: Protocols for distributed (threshold) 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 not fully secure: they either allow a single corrupted party to bias the key, or are not robust and allow a single malicious party to prevent successful generation of a key. We explore the round complexity of fully secure DKG in the honest-majority setting where it is feasible. We show the impossibility of one-round, unbiased DKG protocols (even satisfying weaker notions of security), regardless of any prior setup. On the positive side, we show various round-optimal protocols for fully secure DKG offering tradeoffs in terms of their efficiency, necessary setup, and required assumptions.
BibTeX
@inproceedings{crypto-2024-34183,
  title={Round-Optimal Fully Secure Distributed Key Generation},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-68394-7_10},
  author={Jonathan Katz},
  year=2024
}