Spurt: Scalable Distributed Randomness Beacon with Transparent Setup
Sourav Das, Vinith Krishnan, Irene Miriam Isaac, Ling Ren
Abstract
Having shared access to high-quality random numbers is essential in many important applications. Yet, existing constructions of distributed random beacons still have limitations such as imperfect security guarantees, strong setup or network assumptions, or high costs. In this paper, we present Spurt, an efficient distributed randomness beacon protocol that does not require any trusted or expensive setup and is secure against a malicious adversary that controls up to one-third of the nodes in a partially synchronous network. We formally prove that each output of Spurt is unpredictable, bias-resistant, and publicly verifiable. Spurt has an amortized total communication cost of per beacon output where is the security parameter. While designing Spurt, we also design a publicly verifiable secret sharing (PVSS) scheme whose security is based on the standard Decisional Bilinear Diffie-Hellman assumption and does not require a Random Oracle. We implement Spurt and evaluate it using a network of up to 128 nodes running in geographically distributed AWS instances. Our evaluation shows that Spurt can produce about 84 beacon outputs per minute in a network of 32 nodes and is comparable to systems with stronger assumptions or weaker security.
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.
Cited by top-tier papers19
- Foundations of Transaction Fee Mechanism DesignHao Chung, Elaine ShiSODA 2023 · 53 citations
- Riggs: Decentralized Sealed-Bid AuctionsNirvan Tyagi, Arasu Arun, Cody Freitag, Riad S. Wahby et al.CCS 2023 · 15 citations
- Public Randomness Extraction with Ephemeral Roles and Worst-Case CorruptionsJesper Buus Nielsen, João Ribeiro, Maciej ObremskiCRYPTO 2022 · 8 citations
- Optimal Sharding for Scalable Blockchains with Deconstructed SMRJianting Zhang, Zhongtang Luo, Raghavendra Ramesh, Aniket KateVLDB 2025 · 7 citations
- 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
Builds on9
- A Secure Sharding Protocol For Open BlockchainsLoi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja et al.CCS 2016 · 1,392 citations
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly et al.S&P 2018 · 1,145 citations
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 1,084 citations
- Scalable Bias-Resistant Distributed RandomnessEwa Syta, Philipp Jovanovic, Eleftherios Kokoris-Kogias, Nicolas Gailly et al.S&P 2017 · 327 citations
- Chainspace: A Sharded Smart Contracts PlatformMustafa Al-Bassam, Alberto Sonnino, Shehar Bano, Dave Hrycyszyn et al.NDSS 2018 · 313 citations
Related papers
- HydRand: Efficient Continuous Distributed RandomnessPhilipp Schindler, Aljosha Judmayer, Nicholas Stifter, Edgar R. WeipplS&P 2020 · 78 citations
- SoK: Distributed Randomness BeaconsKevin Choi, Aathira Manoj, Joseph BonneauS&P 2023
- OptRand: Optimistically Responsive Reconfigurable Distributed RandomnessAdithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik NayakNDSS 2023
- RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic CommunicationAdithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate et al.CCS 2021 · 5 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
