Paper 2021/1635

Synchronous Distributed Key Generation without Broadcasts

Abstract

Distributed key generation (DKG) is an important building block in designing many efficient distributed protocols. In this work, we initiate the study of communication complexity and latency of distributed key generation protocols under a synchronous network in a point-to-point network. Our key result is the first synchronous DKG protocol for discrete log-based cryptosystems with $$ communication complexity ($$ denotes a security parameter) that tolerates $$ Byzantine faults among $$ parties. We show two variants of the protocol: a deterministic protocol with $$ latency and randomized protocol with $$ latency in expectation where $$ denotes the bounded synchronous delay. In the process of achieving our results, we design (1) a gradecast protocol with optimal communication complexity of $$ for linear-sized inputs and latency of $$, (2) a primitive called ``recoverable set of shares'' for ensuring recovery of shared secrets, (3) an oblivious leader election protocol with $$ communication and $$ latency, and (4) a multi-valued validated Byzantine agreement (MVBA) protocol with $$ communication complexity for linear-sized inputs and $$ latency in expectation. Each of these primitives may be of independent interest.