Paper 2022/193

OptRand: Optimistically responsive distributed random beacons

Adithya Bhat, Aniket Kate, Kartik Nayak, and Nibesh Shrestha


Distributed random beacons publish random numbers at regular intervals, which anyone can obtain and verify. The design of public distributed random beacons has been an exciting research direction with significant implication to blockchains, voting and beyond. Random beacons, in addition to being bias-resistant and unpredictable, also need to have low communication cost, low latency, and ease of reconfigurability. Existing works on synchronous random beacons sacrifice one or more of these properties. In this work, we design an efficient unpredictable synchronous random beacon protocol, OptRand, with quadratic (in the number $n$ of system nodes) communication complexity per beacon output. First, we innovate by employing a novel combination of bilinear pairing based publicly verifiable secret sharing and non-interactive zero-knowledge proofs to build a linear (in $n$) sized publicly verifiable random sharing. Second, we develop a state machine replication protocol with linear-sized inputs that is also optimistically responsive, i.e., it can progress responsively at actual network speed during optimistic conditions, despite the synchrony assumption, and thus incur low latency. In addition, we present an efficient reconfiguration mechanism for OptRand that allows nodes to leave and join the system.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Random Beacons
Contact author(s)
abhatk @ purdue edu
2022-02-20: received
Short URL
Creative Commons Attribution


      author = {Adithya Bhat and Aniket Kate and Kartik Nayak and Nibesh Shrestha},
      title = {OptRand: Optimistically responsive distributed random beacons},
      howpublished = {Cryptology ePrint Archive, Paper 2022/193},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.