Paper 2025/406
AsyRand: asynchronous distributed randomness beacon with reconfiguration
Abstract
Distributed randomness beacon protocols, which continuously generate publicly verifiable randomness values, are crucial for many applications. Recently, there have been many approaches, such as Hydrand (S\&P'20), SPURT (S\&P'22), OptRand (NDSS'23) and GRandLine (CCS'24), based on publicly verifiable secret sharing (PVSS) to implement beacon protocols. However, two key challenges remain unresolved: asynchrony and reconfiguration. In this paper, we propose the $\mathsf{AsyRand}$ beacon protocol to address these challenges. We incorporate a producer-consumer model to decouple the distribution and reconstruction of PVSS secrets. Parties continuously produce and distribute new PVSS commitments, which are the encrypted shares and the proofs. Meanwhile, all parties store received commitments using first-in-first-out queues and collectively consume each commitment to recover the corresponding secret for beacon generation. To achieve asynchronous consensus, we employ reliable broadcast for distribution and apply $t$-validated asynchronous Byzantine agreement for reconstruction. To achieve reconfiguration, honest parties can collectively remove a faulty party if his queue remains empty for an extended duration, and a new party can join the system using reliable broadcast. We also introduce a novel PVSS scheme based on Sigma protocol and Fiat-Shamir heuristic, which is of independent interest. Consequently, $\mathsf{AsyRand}$ maintains state-of-the-art complexity with $O(n^2)$ communication complexity, $O(n)$ computation complexity, and $O(n)$ verification complexity while achieving asynchrony and reconfiguration. Experimental results highlight the performance of $\mathsf{AsyRand}$ compared to existing works.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- PVSSdistributed randomness beaconreliable broadcastconsensus
- Contact author(s)
- briliasm @ gmail com
- History
- 2025-04-24: last of 6 revisions
- 2025-03-03: received
- See all versions
- Short URL
- https://ia.cr/2025/406
- License
-
CC0
BibTeX
@misc{cryptoeprint:2025/406, author = {Liang Zhang and Tao Liu and Haibin Kan and Jiheng Zhang}, title = {{AsyRand}: asynchronous distributed randomness beacon with reconfiguration}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/406}, year = {2025}, url = {https://eprint.iacr.org/2025/406} }