Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup

Hanwen Feng; Qiang Tang

Paper 2024/2098

Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup

Hanwen Feng

, University of Sydney

Qiang Tang, University of Sydney

Abstract

We present the first optimal-resilient, adaptively secure asynchronous common coin protocol with $O(\lambda n^2)$ communication complexity and $O(1)$ rounds, requiring only a public silent setup. Our protocol immediately implies a sequence of quadratic-communication, constant-round asynchronous Byzantine agreement protocols, and also asynchronous distributed key generation with a silent setup. Along the way, we formulate a new primitive called {\em asynchronous subset alignment}, and introduce a simple framework to reason about specific composition security suitable for asynchronous common coin, enhancing security and functionality of silent-setup threshold encryption, which may be of independent interests.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Asynchronous Common Coin Asynchronoud Distributed Key Generation
Contact author(s): hanw feng94 @ gmail com
qiang tang @ sydney edu au
History: 2025-02-18: last of 3 revisions; 2024-12-31: received; See all versions
Short URL: https://ia.cr/2024/2098
License: CC BY

BibTeX

@misc{cryptoeprint:2024/2098,
      author = {Hanwen Feng and Qiang Tang},
      title = {Asymptotically Optimal Adaptive Asynchronous Common Coin and {DKG} with Silent Setup},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/2098},
      year = {2024},
      url = {https://eprint.iacr.org/2024/2098}
}