Paper 2025/406

AsyRand: fast asynchronous distributed randomness beacon with reconfiguration

Liang Zhang, Hong Kong University of Science and Technology
Tao Liu, Hainan University
Zhanrong Ou, Hainan University
Haibin Kan, Fudan University
Jiheng Zhang, Hong Kong University of Science and Technology
Abstract

Distributed randomness beacon protocols, which generate publicly verifiable randomness at regular intervals, are crucial for a wide range of applications. The publicly verifiable secret sharing (PVSS) scheme is a promising cryptographic primitive for implementing beacon protocols, such as Hydrand (S\&P '20) and SPURT (S\&P '22). However, two key challenges for practical deployment remain unresolved: asynchrony and reconfiguration. In this paper, we introduce the $AsyRand$ beacon protocol to address these challenges. In brief, $AsyRand$ leverages Bracha Reliable Broadcast (BRB) or BRB-like protocols for message dissemination and incorporates a producer-consumer model to decouple the production and consumption of PVSS commitments. In the producer-consumer model, PVSS commitments are produced and consumed using a queue data structure. Specifically, the producer process is responsible for generating new PVSS commitments and reaching consensus on them within the queue, while the consumer process continuously consumes the commitments to recover PVSS secrets and generate new beacon values. This separation allows the producer and consumer processes to operate simultaneously and asynchronously, without the need for a global clock. Moreover, the producer-consumer model enables each party to detect potential faults in other parties by monitoring the queue length. If necessary, parties in $AsyRand$ can initiate a removal process for faulty parties. BRB is also employed to facilitate the addition of new parties without requiring a system restart. In summary, $AsyRand$ supports reconfiguration, enhancing both the protocol's usability and reliability. Additionally, we propose a novel PVSS scheme based on the $\Sigma$ protocol, which is of independent interest. Regarding complexity, $AsyRand$ achieves state-of-the-art performance with $O(n^2)$ communication complexity, $O(n)$ computation complexity, and $O(n)$ verification complexity.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
PVSSdistributed randomness beaconreliable broadcastconsensus
Contact author(s)
briliasm @ gmail com
History
2025-03-04: approved
2025-03-03: received
See all versions
Short URL
https://ia.cr/2025/406
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2025/406,
      author = {Liang Zhang and Tao Liu and Zhanrong Ou and Haibin Kan and Jiheng Zhang},
      title = {{AsyRand}: fast asynchronous distributed randomness beacon with reconfiguration},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/406},
      year = {2025},
      url = {https://eprint.iacr.org/2025/406}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.