HashRand: Efficient Asynchronous Random Beacon without Threshold Cryptographic Setup

ePrint Report: HashRand: Efficient Asynchronous Random Beacon without Threshold Cryptographic Setup

Akhil Bandarupalli, Adithya Bhat, Saurabh Bagchi, Aniket Kate, Michael Reiter

Regular access to unpredictable and bias-resistant randomness is important for applications such as blockchains, voting, and secure distributed computing. Distributed random beacon protocols address this need by distributing trust across multiple nodes, with the majority of them assumed to be honest. These protocols have found applications in blockchain technology, leading to the proposal of several distributed random beacon protocols, …

access address applications asynchronous beacon bias blockchains computing cryptographic distributed distributed computing eprint report important michael protocols random randomness regular report threshold trust voting