Return
Asynchronous Random Committee Election for Preprocessing in Asynchronous Distributed Key Generation
DOI:10.1109/tnse.2026.3718314.png)
Abstract
En 中文
Distributed Key Generation (DKG) allows multiple nodes to jointly generate a public-private key pair through threshold secret sharing without relying on a trusted third party, and serves as a key primitive in decentralized applications such as threshold signatures and blockchain systems. However, most conventional DKG protocols assume synchrony and are therefore not well suited to fully asynchronous environments. Existing asynchronous DKG (ADKG) protocols mainly optimize internal components, while largely overlooking preprocessing strategies that can fundamentally simplify ADKG. To address this issue, we shift consensus-related operations to an offline preprocessing stage, thereby reducing the online complexity of the ADKG phase. Specifically, we design an asynchronous preprocessing random committee election (PRCE) protocol with $O(\lambda n^{3})$ communication in the security parameter $\lambda$ and the number of nodes $n$, reducing the number of consensus invocations in the ADKG phase from $O(n)$ to $O(1)$. We further propose a bivariate asymmetric asynchronous complete secret sharing (BAACSS) scheme that achieves integrity recovery without leaking the privacy of the original share set with $O(\lambda n^{3})$ communication. The scheme relies only on the discrete logarithm assumption, supports both low-threshold and high-threshold settings, and requires neither the random oracle model nor a public key infrastructure. Experimental results show that our preprocessing random ADKG (PRADKG) protocol improves online runtime by 58.77% over the state-of-the-art method in a system with $n=49$ and reconstruction threshold $\ell =17$.
Keywords:
Asynchronous distributed key generation
asynchronous complete secret sharing
network security
distributed systems
asynchronous Byzantine agreement
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K
Organization
Cited Papers
No cited papers available

