HydRand: Efficient Continuous Distributed Randomness
Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, Edgar R. Weippl
Abstract
A reliable source of randomness is not only an essential building block in various cryptographic, security, and distributed systems protocols, but also plays an integral part in the design of many new blockchain proposals. Consequently, the topic of publicly-verifiable, bias-resistant and unpredictable randomness has recently enjoyed increased attention. In particular random beacon protocols, aimed at continuous operation, can be a vital component for current Proof-of-Stake based distributed ledger proposals. We improve upon previous random beacon approaches with HydRand, a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values. Furthermore, HydRand provides guaranteed output delivery of randomness at regular and predictable intervals in the presence of adversarial behavior and does not rely on a trusted dealer for the initial setup. Compared to existing PVSS based approaches that strive to achieve similar properties, our solution improves scalability by lowering the communication complexity from to . Furthermore, we are the first to present a detailed comparison of recently described schemes and protocols that can be used for implementing random beacons.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext adcc3bd5-cc29-4027-8143-9371dfa0f200Cited by top-tier papers6
- Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold CryptographyAkhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate et al.CCS 2024 · 6 citations
- RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic CommunicationAdithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate et al.CCS 2021 · 5 citations
- Efficient CCA Timed Commitments in Class GroupsSri Aravinda Krishnan Thyagarajan, Guilhem Castagnos, Fabien Laguillaumie, Giulio MalavoltaCCS 2021 · 2 citations
- Rondo: Scalable and Reconfiguration-Friendly Randomness BeaconXuanji Meng, Xiao Sui, Zhaoxin Yang, Kang Rong et al.NDSS 2025
- HeadStart: Efficiently Verifiable and Low-Latency Participatory Randomness Generation at ScaleHsun Lee, Yuming Hsu, Jing-Jie Wang, Hao-Cheng Yang et al.NDSS 2022
Builds on2
- Scalable Bias-Resistant Distributed RandomnessEwa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly et al.S&P 2017 · 327 citations
- Keeping Authorities "Honest or Bust" with Decentralized Witness CosigningEwa Syta, Iulia Tamas, Dylan Visher, David Isaac Wolinsky et al.S&P 2016 · 285 citations
Related papers
- OptRand: Optimistically Responsive Reconfigurable Distributed RandomnessAdithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik NayakNDSS 2023
- SoK: Distributed Randomness BeaconsKevin Choi, Aathira Manoj, Joseph BonneauS&P 2023
- Spurt: Scalable Distributed Randomness Beacon with Transparent SetupSourav Das, Vinith Krishnan, Irene Miriam Isaac, Ling RenS&P 2022 · 80 citations
- Distributed Randomness Using Weighted VUFsSourav Das, Benny Pinkas, Alin Tomescu, Zhuolun XiangEUROCRYPT 2025 · 7 citations
- GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication ComplexityRenas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither et al.CCS 2024 · 7 citations
